scalax.collection.GraphTraversal
All edges of this path in proper order.
All edges of this path in proper order.
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.
All nodes of this path in proper order.
All nodes of this path in proper order.
The number of edges on this path.
The number of edges on this path.
Semantically compares this cycle with that cycle.
Semantically compares this cycle with that cycle. While == returns true
only if the cycles contain the same elements in the same order, this comparison
returns also true if the elements of that cycle can be shifted and optionally
reversed such that their elements have the same order. For instance, given
c1 = Cycle(1-2-3-1), c2 = Cycle(2-3-1-2) and c3 = Cycle(2-1-3-2)
the following expressions hold:
c1 != c2, c1 != c3 but c1 sameAs c2 and c1 sameAs c3.
Same as sameAs but also comparing this cycle with any Traversable.
(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.
The number of nodes and edges on this path.
(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.
The cumulated weight of all edges on this path.
(cycle: MonadOps[OutParam[N, E]]).filter(p)
(cycle: MonadOps[OutParam[N, E]]).flatMap(f)
(cycle: MonadOps[OutParam[N, E]]).map(f)
(cycle: StringAdd).self
(cycle: StringFormat).self
(cycle: OuterNode[Cycle]).stringPrefix
(cycle: OuterNode[Cycle]).toString()
(cycle: MonadOps[OutParam[N, E]]).withFilter(p)
(Since version 2.10.0) use fold instead
(cycle: ArrowAssoc[Cycle]).x
(Since version 2.10.0) Use leftOfArrow instead
(cycle: Ensuring[Cycle]).x
(Since version 2.10.0) Use resultOfEnsuring instead
Represents a cycle in this graph listing the nodes and connecting edges on it with the following syntax:
cycle ::= start-end-node { edge node } edge start-end-nodeAll nodes and edges on the path are distinct except the start and end nodes that are equal. A cycle contains at least a start node followed by any number of consecutive pairs of an edge and a node and the end node equaling to the start 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.