Diskussion:Longest paths: Dijkstra 3

The theory about the longest path is correctly explained. It is very important to recognize the differances to the shortest path.

Here two differences of the shortest path:

1. The calculation of the longest path demands directed arcs in order to proceed a correct solution. 2. Furthermore loops have to be eliminated, otherwise the solution would be infinite and therefore invalid.

In this case the problem is correct.

The example to calculate the longest path is correct because the problem show you have to respect all path from one node to another node to reach the final node.

The last itarations step is not correct because H=18 and not H=21. But all in all the longest path is correct A-B-D-F-K-L =22