scalax.collection.GraphTraversalImpl
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.
All nodes on this path/walk in proper order.
All nodes on this path/walk in proper order.
(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.
(minWeightEdgeLazyPath: MonadOps[GraphTraversalImpl.InnerElem]).filter(p)
(minWeightEdgeLazyPath: MonadOps[GraphTraversalImpl.InnerElem]).flatMap(f)
(minWeightEdgeLazyPath: MonadOps[GraphTraversalImpl.InnerElem]).map(f)
(minWeightEdgeLazyPath: StringAdd).self
(minWeightEdgeLazyPath: StringFormat).self
(minWeightEdgeLazyPath: OuterNode[MinWeightEdgeLazyPath]).stringPrefix
(minWeightEdgeLazyPath: OuterNode[MinWeightEdgeLazyPath]).toString()
(minWeightEdgeLazyPath: MonadOps[GraphTraversalImpl.InnerElem]).withFilter(p)
(Since version 2.10.0) use fold instead
(minWeightEdgeLazyPath: ArrowAssoc[MinWeightEdgeLazyPath]).x
(Since version 2.10.0) Use leftOfArrow
instead
(minWeightEdgeLazyPath: Ensuring[MinWeightEdgeLazyPath]).x
(Since version 2.10.0) Use resultOfEnsuring
instead
LazyPath
with edges selected by minimal weight.