Represents a module dependency graph.
Adds an edge between two vertices to the graph.
Adds a vertex to the graph and sets its ID.
Walks the graph and marks cyclic vertices and edges.
Returns a list of strongly connected components using Tarjan's algorithm.
The edges or import statements.
The vertices or modules.
See Implementation
Represents a module dependency graph.