Abstract
For the determination of minimum paths in a road network the authors have looked for the most efficient algorithm. This work has been part of the building of a traffic model for rural areas. The algorithm chosen was that by Dijkstra. Apart from the minimum path also the 'next best' has to be determined and that is why an algorithm was chosen which produces the N-e path as a longer alternative for the shortest n-1 path which was originally calculated.