Graph Algorithms: Floyd-Warshall All-Pairs Shortest Distances

Use this endpoint when you need shortest distances between ALL pairs of nodes simultaneously (not just from a single source), especially when the graph may contain negative edge weights. Prefer this over Dijkstra (single-source, no negative weights) or Bellman-Ford (single-source) when you need the complete O(n²) distance matrix in one call. Ideal for small-to-medium graphs up to 100 nodes. If the graph is a DAG and you only need ordering, prefer the topological sort endpoint instead.

• Graph exceeds 100 nodes — endpoint only supports up to 100 nodes
• Edge list exceeds 1000 edges or 60000 characters — request rejected
• Node name contains disallowed characters (must be letters, digits, _ . : + - and 1-32 chars long)
• Malformed edge format — edges must be 'from,to' or 'from,to,weight' separated by ; or newline or valid JSON array
• Negative cycle detected — distances become undefined; endpoint reports the cycle instead of a full distance matrix
• Missing required 'edges' query parameter — request will fail
• Undirected graph with a negative edge will always be a negative cycle — verdict returned immediately