Another graph package in Go.
- Generic type support for vertex types
- Directed and undirected graphs
- Weighted edges
- Add/remove vertices and edges
- Cycle detection
- Dijkstra (non-negative weights)
- Bellman-Ford (handles negative weights, detects negative cycles)
- Floyd-Warshall (all-pairs shortest paths)
- A* (heuristic-based pathfinding)
- BFS shortest path (unweighted graphs)
- Kruskal's algorithm
- Prim's algorithm
- Topological sort (for DAGs)
- Connected components detection
- Neighborhood queries with distance filters
- Depth-first search (DFS)
- Breadth-first search (BFS)
- Visitor pattern support for custom traversal logic