About DAG Generator

A simple DAG (Directed Acyrlic Graph) Generator.

The Critical Path Algorithm is then applied to find the earliest possible finish time. This is denoted by the green lines.

DAG Settings
Nodes:
200
Edges:
1-10
Communication Time:
5-20
Computation Time:
5-20
Layer Count:
5-20
Calculate critical path:
DAG Information
Current Node ID:
Computation Time:
Previous Edges:
Next Edges:
Critical Node:

Number of Nodes:
Number of Edges:
Earliest Possible Finish:
Warnings/Errors
Performance Warnings
  • High number of nodes
  • Low number of layers and high node count
  • Calculating critical path with high node count.