graph

Includes all essential graph algorithms like BFS, DFS, topological ordering, max flow, and MST, as listed in the README, covering most common computational graph problems.

The frozen API ensures long-term compatibility and reliability, with changes limited to bug fixes and performance enhancements, as stated in the philosophy and roadmap.

Virtual graphs allow construction without storing vertices or edges in memory, enabling handling of large graphs through on-the-fly computation, detailed in the build subpackage.

Mutable graphs use hash maps for constant-time edge operations, and immutable graphs use sorted lists for predictable iteration, providing flexibility for different performance needs.