scalax.collection.GraphTraversal
All edges of this path/walk in proper order.
All edges of this path/walk in proper order.
All nodes on this path/walk in proper order.
All nodes on this path/walk in proper order.
Returns whether the nodes and edges on this path are valid with respect to this graph.
The number of edges on this path/walk.
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.
The cumulated weight of all edges on this path/walk.
(path: MonadOps[GraphTraversal.InnerElem]).filter(p)
(path: MonadOps[GraphTraversal.InnerElem]).flatMap(f)
(path: MonadOps[GraphTraversal.InnerElem]).map(f)
(path: OuterNode[Path]).stringPrefix
(path: OuterNode[Path]).toString()
(path: MonadOps[GraphTraversal.InnerElem]).withFilter(p)
Represents a path in this graph where
path::= node { edge node }Nodes and edges on the path are distinct. 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.