Add Node
Add Edge
Move
Delete
Directed
Teaching Mode
Shortest Path
MST
Euler Trail
Hamilton Path
Max Flow
Critical Path
Crash
Allocation
Matrix
Examples…
Weighted network (paths & MST)
Bridges multigraph (Euler)
Flow network (max flow)
Activity network (CPM, dummy)
Bipartite (allocation)
Save
Load
Export PNG
Clear
OK
Adjacency matrix
×
◀ Prev
▶ Play
Next ▶
↺ Reset
Speed
Slow
Medium
Fast
0 / 0
×
Activity Table
Activity
Duration
Direct prerequisites
Latest start
Max reduction
Crash cost / unit
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
Crash the Project
Target duration:
Cancel
Crash