Graph algorithm library: Dijkstra, A*, Bellman-Ford, Floyd-Warshall, BFS/DFS, MST, min-cut (Stoer-Wagner), topological sort, SCC, bridges...

A versatile implementation of Dijkstra's shortest path algorithm for Gleam.