learngraphtheory.org

Interactive Graph Theory Learning

Guest User

Using app without sign in

Algorithm Selection

This algorithm requires a directed graph. Check Settings tab to configure.

Critical Path Method (CPM)

Identifies the longest sequence of dependent tasks in a project schedule, determining the shortest time possible to complete the project.

Time: O(V + E)
Space: O(V)
Use Case: Project scheduling and bottleneck identification.

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

100%
Nodes: 4
Edges: 4