To find the critical path in a graph G, we need to add a source node s and a sink node t. We have not described the exact way to do that, but it is not difficult.
computer science
Description
In REQUIREMENTS:
number 2: To find the critical path in a
graph G, we need to add a source node s and a sink node t. We have not
described the exact way to do that, but it is not difficult. If we have |V|
nodes initially in the graph, numbered from 0 to |v| -1, we add another two
nodes in the graph: s will be numbered |V| and t will be numbered |V| + 1. we
then find the nodes that have no node pointing to them: these will be connected
with s. following that, we find the nodes that point to no other nodes: these
will be connected to t. implement this scheme so that you have a program that
carries out the whole procedure for detecting critical path
