Module traversal 

Graph traversal algorithms for sparse graphs

This module provides breadth-first search (BFS) and depth-first search (DFS) algorithms for sparse matrices representing graphs.

Enums

TraversalOrder

Traversal order types

Functions

bfs_distances

Compute distances from a source vertex using BFS

breadth_first_search

Breadth-first search traversal

depth_first_search

Depth-first search traversal

depth_first_search_recursive

Recursive depth-first search traversal

has_path

Check if there is a path between two vertices

reachable_vertices

Find all vertices reachable from a source vertex

topological_sort

Topological sort of a directed acyclic graph (DAG)

traversegraph

Perform graph traversal from a starting vertex