Graph data structure supporting directed and undirected modes with adjacency list storage. Includes BFS, DFS, Dijkstra shortest path, topological sort, cycle detection, connected components, minimum spanning tree, maximum flow, graph coloring, bipartiteness checking, strongly connected components, and DOT/JSON serialization.
Required Ruby Version
>= 3.1.0
Authors
Philip Rehberger
Versions
- 0.5.0 April 29, 2026 (13.5 KB)
- 0.4.0 April 17, 2026 (13.5 KB)
- 0.3.0 April 11, 2026 (13 KB)
- 0.2.4 April 09, 2026 (11.5 KB)
- 0.2.3 April 01, 2026 (11.5 KB)
