3.3 Applications


3.3.1 Precedence Identification


• To determine a precedence we add a precedence count for each vertex. The basic check is,

1. Set all the precendence values to 1 (lowest precedence)

2. Cycle through and check each edge. For each edge ensure that the ’to’ vertex has a precedence that is at least one greater than the ’from vertex.


• Consider a Network Diagram for a CPM problem.


• The algorithm implemented in Scilab (assuming the ’find_index’ function is the same as before)


3.3.2 Graph Searching


• Identifying the vertex costs.