(classic problem)
Definition: Find the longest path from any source to any sinks in a directed acyclic graph which has weights, or numeric values, on vertices.
Note: This can be solved with a variant of the DAG shortest paths algorithm by assigning an initial distance of negative infinity (-∞), updating the distance and predecessor if dist(v) + weight(u) > dist(u), and recording the greatest distance found so far.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 19 April 2004.
HTML page formatted Mon Sep 11 09:46:02 2006.
Cite this as:
Paul E. Black, "critical path problem", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 19 April 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/criticalPath.html
