Using the precedence list, A and B emanate from the start node; C and D converge to a common node (since E and F each need both C and D); E, F branch out and are followed by G, H respectively.

Step 1 — Read the precedence table.

Step 2 — Place starting activities. A and B have no predecessors, so both start from node 1: A $= 1\to 2$, B $= 1\to 3$.

Step 3 — Place C and D and merge them. C follows A ($2\to 4$) and D follows B ($3\to 4$). Because both E and F require both C and D, C and D must end at the same event (node 4).

Step 4 — Branch E and F, then G and H. From node 4: E $= 4\to 5$ and F $= 4\to 6$. G follows E ($5\to 7$) and H follows F ($6\to 8$).

…