Diskussion:Longest paths: Dijkstra 4

Theory

The Wiki-entry seems to be assessable and comprehensible. First, it is explained where the longest path came from. After that the restrictions to solve the longest path problem with the Dijkstra method were pointed out. It would have been great to tell why and when the algorithm is used (in real life). It is explained how to solve the problem theoretical with the step by step method. This is another method to solve the longest path problem. By using the step by step method it is possible to solve small graphs easily.

The theoretical part is illustrated by using an example in practice.

Example

This chapter presents the example. It is explained easily how to start. The following iterations are assessable and seem to be right.So does the final solution. Here, there are 6 iterations needed to get to the solution which is ok for this easy example. The reader is able to follow very step. In a more complex graph it will be hard to get efficiently to a solution.

All in all, this Wiki-entry seems to be perspicuous and well-structured.

commented by group 3