{"version":1,"name":"Graph Algorithms","tags":["graph","algorithms","dijkstra","maxflow","network"],"description":"Shortest paths, spanning trees, topological order, components, max flow, graph statistics and all-pairs distances from a caller-supplied edge list.","openapi":"https://graph-algorithms.x402tookit.com/openapi.json","resources":["https://graph-algorithms.x402tookit.com/all-pairs-shortest","https://graph-algorithms.x402tookit.com/bellman-ford","https://graph-algorithms.x402tookit.com/connected-components","https://graph-algorithms.x402tookit.com/graph-stats","https://graph-algorithms.x402tookit.com/max-flow","https://graph-algorithms.x402tookit.com/minimum-spanning-tree","https://graph-algorithms.x402tookit.com/shortest-path","https://graph-algorithms.x402tookit.com/topological-sort"]}