- DFS
Performs a depth-first search of this graph and records interesting info with
each vertex, including
- addEdge
Adds a new directed edge between the vertexes with the given ids. Vertexes for
the given ids must be
- addVertex
Defines a new vertex with the given id. The depth-first search is performed in
the relative order in
- containsCycles
Returns whether the graph contains cycles. The graph must be frozen.
- freeze
Freezes this graph. No more vertexes or edges can be added to this graph after
this method is called
- idsByDFSFinishTime
Returns the ids of the vertexes in this graph ordered by depth-first search
finish time. The graph m
- nonTrivialComponents
Returns the non-trivial components of this graph. A non-trivial component is a
set of 2 or more vert