Traversal Patterns
The chapters of this section describe the steps that shape a walk through the graph: loops, labels and paths, branches, side effects and the sack. Several of them are short pages about the exact rules in a corner of TinkerPop's semantics and the few places where Graphersal differs.
| Page | What it covers |
|---|---|
| Recursive Traversals | repeat() with times(), until(), emit(), loops(); breadth and depth first |
| Bulk and Barriers | how equal traversers are merged, barrier(), why it stays invisible |
| where() Start and End Labels | where() with labels and predicates, filter() versus where() |
| Repeated Labels: select with Pop | select(Pop.first/last/all/mixed, ...), the Groovy copy-paste table |
| Path Windows | from()/to() on path(), simple_path(), cyclic_path() |
| union() as a Start Step | g.union(...) without v() |
| Branch Children and Global State | how union(), choose() and branch() feed their children |
| Option Keys of choose() and branch() | option() keys and unmatched traversers |
| The by() Modulator: Single-by Steps | steps that take one by() |
| Set Side Effects, tree() as a Side Effect | aggregate(), store(), cap(), tree("key") |
| Sack and Operators | with_sack(), sack(), Operator, reducers |