learngraphtheory.org

Interactive Graph Theory Learning

Guest User

Sign in to save progress

Algorithm Selection

Active
Algorithm is currently active

Traveling Salesman Problem

Finds shortest tour visiting all vertices exactly once

Time: O(n² × 2ⁿ)
Space: O(n × 2ⁿ)
Use Case: Route optimization, logistics, circuit board drilling

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
Traveling Salesman Problem