Module graph
Source - AdjacencyMap
- A graph traversal that builds an adjacency map
- NonDeterministic
- A graph traversal that does not guarantee any particular order, and may not
return the same order every time it is run.
- SkipDuplicates
- A
GraphStore wrapper that skips nodes that have already been
visited. - VisitedNodes
- A list of modules that were already visited and should be skipped (including their subgraphs).
- GraphTraversalResult
- VisitControlFlow
- The control flow of visiting an edge during a graph traversal.
- GraphStore
- A graph store is a data structure that will be built up during a graph
traversal. It is used to store the results of the traversal.
- GraphTraversal
GraphTraversal is a utility type that can be used to traverse a graph of
nodes, where each node can have a variable number of outgoing edges.- Visit
- A trait that allows a graph traversal to visit the edges of a node
transitively.