{"provider":{"host":"graph-algorithms.x402tookit.com","name":"Graph Algorithms","score":10.5,"live":false,"checkedAt":null,"uptime72h":null,"lastCheck":null,"endpoints":8,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"cheapestUsd":"0.02","income7dUsd":"8.49","payers7d":2,"transfers7d":287,"payoutAddressShared":true,"claimed":false,"page":"https://logicnodes.io/observatory/p/graph-algorithms.x402tookit.com"},"endpoints":[{"url":"https://graph-algorithms.x402tookit.com/bellman-ford","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Bellman-Ford shortest paths with negative weights; reports a negative cycle reachable from the source."},{"url":"https://graph-algorithms.x402tookit.com/connected-components","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Connected components of an edge list; with directed=true also strongly connected components via Tarjan."},{"url":"https://graph-algorithms.x402tookit.com/graph-stats","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Graph statistics: degree sequence, density, bipartite check, tree or forest test, and diameter if connected."},{"url":"https://graph-algorithms.x402tookit.com/minimum-spanning-tree","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Kruskal minimum spanning tree of an undirected weighted edge list; returns a spanning forest if disconnected."},{"url":"https://graph-algorithms.x402tookit.com/shortest-path","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Dijkstra shortest path and distances from a source on a weighted edge list; negative weights point to /bellman-ford."},{"url":"https://graph-algorithms.x402tookit.com/topological-sort","method":"GET","priceMicroUsd":20000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Topological order of a directed graph (Kahn) with parallel layers; on a cycle returns the cycle's nodes."},{"url":"https://graph-algorithms.x402tookit.com/all-pairs-shortest","method":"GET","priceMicroUsd":30000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Floyd-Warshall all-pairs shortest distances for up to 100 nodes; negative weights ok; detects negative cycles."},{"url":"https://graph-algorithms.x402tookit.com/max-flow","method":"GET","priceMicroUsd":30000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Edmonds-Karp maximum flow from a source to a sink on a capacity edge list, with flow per edge and min cut edges."}]}