In a
valued and
directed graph representing different operations to carry out to accomplish a task, a path in which the value is optimal (maximum or minimum depending on the context) between two vertices called the
start and the
end of the task.
Examples
- In the valued and directed graph below, the critical path with the maximum value is the path D-1-6-8-9-F, which has a value of 14.
![](https://www.netmaths.net/medias_collection/Illustrations/Lexique/Graph_Critical_Path.svg)
- In the valued and directed graph above, the critical path with the minimum value is the path D-3-F, which has a value of 7.