scalax.collection.GraphTraversal
Tries to add edge
to the tail of the path/walk.
Tries to add edge
to the tail of the path/walk.
Whether the addition was successful.
Tries to add node
to the tail of the path/walk.
Tries to add node
to the tail of the path/walk.
Whether the addition was successful.
The node this walk starts at.
Tries to add edge
to the tail of the path/walk.
Tries to add edge
to the tail of the path/walk.
Tries to add node
to the tail of the path/walk.
Tries to add node
to the tail of the path/walk.
Tries to add elem
to the tail of the path/walk.
Tries to add elem
to the tail of the path/walk.
Tries to add elem
to the tail of the path/walk.
Tries to add elem
to the tail of the path/walk.
Whether the addition was successful.
(walkBuilder: StringAdd).self
(walkBuilder: StringFormat).self
(walkBuilder: OuterNode[WalkBuilder]).toString()
(walkBuilder: ArrowAssoc[WalkBuilder]).x
(Since version 2.10.0) Use leftOfArrow
instead
(walkBuilder: Ensuring[WalkBuilder]).x
(Since version 2.10.0) Use resultOfEnsuring
instead
A
Builder
for valid walks in this graph.Nodes and edges may be added either alternating or node by node respectively edge by edge. Either way, the builder ensures that the added elements build a valid walk.
A node addition fails if the node to be added is not a direct successor of the previously added node or of the target node of the previously added edge. An edge addition fails if the edge to be added is not an outgoing edge from the previously added node or of the target node of the previously added edge.
It is recommended using
add
instead of+=
to track failed additions.