Floyd-Warshall Solver
Shortest PathMediumCompute all-pairs shortest paths on directed or weighted graphs using intermediate node checks.
Alt+Shift+V
Configuration Panel
Adjust vertices and weights on the canvas above then click run to build the complete all-pairs distance matrix.
Complexity Mappings
Time ComplexityO(V^3)
Space ComplexityO(V^2) distance matrix state
Interactive SVG Graph Canvas
🖱️ Middle-drag to Pan🎡 Scroll wheel to Zoom⌨️ Shift-drag snap to 20px grid
Inspector Panel
Select a vertex or edge to inspect details.
Graph Wizard
Conceptual Overview
Floyd-Warshall's Algorithm solves the all-pairs shortest paths problem on a directed or undirected graph, computing distances between all node pairs.
Algorithm Mechanism
A dynamic programming formulation that updates the distance matrix by testing if routing through intermediate nodes 0..V-1 offers shorter pathways.
Source: CP-Algorithms reference guide