Description
Dependency resolution or route planning in Go usually means writing your own graph and traversal code. graph is a generic library for graph data structures and algorithms where vertices can be ints or any custom type.
It supports traits like directed and acyclic with validation, includes shortest paths, strongly connected components, topological sort and spanning trees, and exports to Graphviz.
Generic vertices:Any type as a vertex.
Graph traits:Directed and acyclic checks.
Algorithms:Shortest paths, SCCs and topological sort.
Visualization:DOT output for Graphviz.
It supports traits like directed and acyclic with validation, includes shortest paths, strongly connected components, topological sort and spanning trees, and exports to Graphviz.
Features
Generic vertices:Any type as a vertex.
Graph traits:Directed and acyclic checks.
Algorithms:Shortest paths, SCCs and topological sort.
Visualization:DOT output for Graphviz.
Screenshots
Tags:go