learngraphtheory.org

Interactive Graph Theory Learning

Guest User

Sign in to save progress

Algorithm Selection

Active
Algorithm is currently active

Bellman-Ford Algorithm

Finds shortest paths and detects negative weight cycles

Time: O(VE)
Space: O(V)
Use Case: Graphs with negative weights, currency arbitrage detection

Algorithm Execution

Select an algorithm and generate steps to begin visualization

Interactive Controls
Basic Actions
• Double Click → Add Node
• Drag → Move Nodes
• Shift + Click → Connect Nodes
• Right Click → Context Menu
Advanced
• Ctrl + Click → Multi-Select
• Delete Key → Remove Selected
• Double Click Edge → Edit Weight
• Ctrl + Drag → Pan View

Zoom Controls

Ctrl + / -
100%
Zoom:Ctrl + / -
Reset:Ctrl + 0
Toggle:Ctrl + Shift + Z
Nodes: 4
Edges: 4
Bellman-Ford Algorithm