-
Notifications
You must be signed in to change notification settings - Fork 7
Expand file tree
/
Copy pathTabbyTraversalPathFinder.java
More file actions
58 lines (48 loc) · 2 KB
/
Copy pathTabbyTraversalPathFinder.java
File metadata and controls
58 lines (48 loc) · 2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
package tabby.path;
import org.neo4j.graphalgo.EvaluationContext;
import org.neo4j.graphdb.Node;
import org.neo4j.graphdb.PathExpander;
import org.neo4j.graphdb.Transaction;
import org.neo4j.graphdb.traversal.InitialBranchState;
import org.neo4j.graphdb.traversal.TraversalDescription;
import org.neo4j.graphdb.traversal.Traverser;
import tabby.data.TabbyState;
import tabby.evaluator.TabbyEvaluator;
/**
* @author wh1t3p1g
* @since 2023/8/23
*/
public class TabbyTraversalPathFinder extends BasePathFinder<TabbyState> {
private InitialBranchState.State<TabbyState> state;
private boolean checkAuth = false;
private boolean isBackward = false;
private TabbyState endState = null;
public TabbyTraversalPathFinder(EvaluationContext context,
PathExpander<TabbyState> expander,
TabbyState initialState,
TabbyState endState, Number maxDepth,
boolean depthFirst, boolean checkAuth, boolean isBackward) {
super(context, expander, maxDepth, depthFirst);
this.state = new InitialBranchState.State<>(initialState, TabbyState.of());
this.checkAuth = checkAuth;
this.isBackward = isBackward;
this.endState = endState;
}
@Override
protected Traverser instantiateTraverser(Node start, Node end) {
Transaction transaction = context.transaction();
TraversalDescription base = getBaseDescription(transaction);
return base.expand(expander, state)
.evaluator(TabbyEvaluator.of(end, endState, maxDepth, checkAuth, isBackward))
.traverse(start);
}
public TraversalDescription getBaseDescription(Transaction transaction){
TraversalDescription base = transaction.traversalDescription();
if(depthFirst){
base = base.depthFirst();
}else{
base = base.breadthFirst();
}
return base.uniqueness(uniqueness());
}
}