T extends Object> class
Utility class for crawling a graph defined by edges and retrieving paths and walks.
- A directed path is defined as a list of connected vertices where each inner vertex is listed at most once. The first and the last vertex may be same in order to represent a cycle.
- A directed walk is defined as a list of connected vertices that can be traversed in sequential order.
T start, [T? target]) → Map< T, List< Set<> T>>
Returns a map containing all paths commencing at
Invocation invocation) → dynamic
Invoked when a non-existent method or property is accessed. [...]
T start, T target) → List< T>
Returns the shortest detected path from
T start, T target) → List< List< T>>
Returns a list containing all paths connecting
) → String
A string representation of this object. [...]
T start, [T? target]) → List< Set< T>>
Returns a tree-like structure with
startas root vertex. [...]