exception
NegativeCycle of t
val shortest_path : Topology.t ‑> Topology.vertex ‑> Topology.vertex ‑> t option
val all_shortest_paths : Topology.t ‑> Topology.vertex ‑> Topology.vertex Topology.VertexHash.t
val all_pairs_shortest_paths : topo:Topology.t ‑> f:(Topology.vertex ‑> Topology.vertex ‑> bool) ‑> (weight * Topology.vertex * Topology.vertex * Topology.edge list) list