# bitgraph v0.4.5 - Table of Contents

Mutable directed graph

## Modules

- [BitGraph](BitGraph.md): Documentation for `BitGraph`.

- [BitGraph.Adjacency](BitGraph.Adjacency.md)
- [BitGraph.Algorithm](BitGraph.Algorithm.md)
- [BitGraph.Algorithm.Matching.Kuhn](BitGraph.Algorithm.Matching.Kuhn.md): Maximum Matching for bipartite graph (Kuhn algorithm).
Implementation mostly follows
https://cp-algorithms.com/graph/kuhn_maximum_bipartite_matching.html
- [BitGraph.Algorithm.SCC.Kozaraju](BitGraph.Algorithm.SCC.Kozaraju.md)
- [BitGraph.Algorithm.SCC.Tarjan](BitGraph.Algorithm.SCC.Tarjan.md)
- [BitGraph.Algorithm.SCC.Utils](BitGraph.Algorithm.SCC.Utils.md)
- [BitGraph.Algorithm.Search.AStar](BitGraph.Algorithm.Search.AStar.md)
- [BitGraph.Common](BitGraph.Common.md)
- [BitGraph.Dfs](BitGraph.Dfs.md): Depth-first search.
Implementation roughly follows
https://cp-algorithms.com/graph/depth-first-search.html

- [BitGraph.E](BitGraph.E.md)
- [BitGraph.Neighbor](BitGraph.Neighbor.md)
- [BitGraph.Traversal.Utils](BitGraph.Traversal.Utils.md)
- [BitGraph.V](BitGraph.V.md)

