The networks used in critical path analysis where the edges (arcs) represent activities to be performed. Paths in the network represent the precedence relations between the activities, and dummy activities are required to link paths where common activities appear, but the paths are at least partly independent. While this is a complication, each activity appears on only one edge, and the sequence of activities needed is easier to follow than when the vertices are used to represent the activities. Once the activity network has been constructed from the precedence table, the critical path algorithm (edges as activities) can be applied.