Module traversal 

Graph traversal algorithms for the code graph.

BFS, DFS, and specialized traversals for dependency analysis, impact analysis, and concept grouping.

Structs

TraversalOptions

Options for graph traversal.

Enums

Direction

Direction of traversal.

Functions

bfs

Perform a breadth-first traversal from the given start node.

dfs

Perform a depth-first traversal from the given start node.

find_paths

Find all paths between two nodes up to a maximum depth.

shortest_path

Find the shortest path between two nodes using BFS.

Type Aliases

TraversalResult

Result of a traversal: a list of (unit_id, depth) pairs.