scalax.collection.GraphTraversal
Returns whether the contents of this path are valid with respect to path semantics.
Returns whether the contents of this path are valid with respect to path semantics. This check is appropriate whenever there may be any doubt about the correctness of the result of an algorithm.
Iterator over the edges of this path.
Iterator over the edges of this path. The result is chached on the first call, so consecutive calls of this method are cheep.
Iterator over all edges of this path in proper order.
List containing all edges of this path in proper order.
The number of edges on this path.
Iterator over the nodes of this path.
Iterator over the nodes of this path. The result is chached on the first call, so consecutive calls of this method are cheep.
Iterator over all nodes of this path in proper order.
List containing all nodes of this path in proper order.
(Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
The cumulated weight of all edges on this path.
(Since version 2.10.0) use fold instead
Represents a path in this graph listing the nodes and connecting edges on it with the following syntax:
path ::= node { edge node }All nodes and edges on the path are distinct. A path contains at least one node followed by any number of consecutive pairs of an edge and a node. The first element is the start node, the second is an edge with its tail being the start node and its head being the third element etc.