scalax.collection.GraphTraversal
All edges of this path/walk in proper order.
All nodes on this path/walk in proper order.
Returns whether the nodes and edges of this walk are valid with respect to this graph.
Returns whether the nodes and edges of this walk are valid with respect to this graph. This optional check is sane if there is reasonable doubt about the correctness of some algorithm results.
The number of edges on this path/walk.
(Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
The number of nodes and edges on this path/walk.
The number of nodes and edges on this path/walk.
(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/walk.
The cumulated weight of all edges on this path/walk.
The weight function overriding edge weights.
The cumulated weight of all edges on this path/walk.
(walk: MonadOps[GraphTraversal.InnerElem]).filter(p)
(walk: MonadOps[GraphTraversal.InnerElem]).flatMap(f)
(walk: MonadOps[GraphTraversal.InnerElem]).map(f)
(walk: StringAdd).self
(walk: StringFormat).self
(walk: OuterNode[Walk]).stringPrefix
(walk: OuterNode[Walk]).toString()
(walk: MonadOps[GraphTraversal.InnerElem]).withFilter(p)
(Since version 2.10.0) use fold instead
(walk: ArrowAssoc[Walk]).x
(Since version 2.10.0) Use leftOfArrow instead
(walk: Ensuring[Walk]).x
(Since version 2.10.0) Use resultOfEnsuring instead
Represents a walk in this graph where
walk::= node { edge node }A walk/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 source being the start node and its target being the third element etc.