In an activity network (edges as activities), the forward scan identifies the earliest time for each vertex. Starting with the source, work forwards through the network, for each vertex calculate the sum of edge plus total time on previous vertex for all paths arriving at that vertex. Assign the largest of these times to that vertex.