JanusGraph / JanusGraph/janusgraph

Add DFS traversal option to Repeat step

Open
#3,787 0 comments 0 reactions 0 assignees View on GitHub
area/core area/tinkerpop kind/performance
Dominant language
Java
Stars
5.8k
Forks
1.2k
Avg merge
13h 53m
Merged PRs (30d)
6

Description

See discussion: #3777

Currently JanusGraph supports only TinkerPop's default Repeat step implementation which is using Breadth-First Search instead of Depth-Fist Search. I believe Depth-Fist Search might be a better solution to number of use cases, knowing that we already support query batching.
I suppose that batched DFS repeat steps might be a better default implementation for repeat step.

Contributor guide

Open the contributing guide

Research direction

Start by reading the discussion in #3777 and the current TinkerPop Repeat step implementation referenced in the issue. Clarify whether the goal is an optional DFS traversal or a new default, then define the affected traversal behavior and tests before implementation.

Written by the indexing model from the issue text.

Assessment

Tech stack
java
Domain
databases
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
25/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.