1. Draw a node for each network activity.
2. Draw an arc for each immediate precedence relation between two activities.
3. Possibly add a dummy start and dummy end node to force that the network begins
with a single start activity and finishes with a single end activity.