Add Node
Add Edge
Move
Delete
Directed
Teaching Mode
Shortest Path
MST
Euler Trail
Hamilton Path
Max Flow
Critical Path
Export PNG
Clear
OK
◀ Prev
▶ Play
Next ▶
↺ Reset
Speed
Slow
Medium
Fast
0 / 0
×
Activity Table
Activity
Duration
Direct prerequisites
Cost
Latest start
Add a name to an edge (e.g.
A
) to populate this table.
Shortest Path (Dijkstra's)
From:
To:
Cancel
Find Path
Maximum Flow / Minimum Cut
Source:
Label:
Sink:
Label:
Cancel
Compute Flow