Arrangement

Excellent Shortest Path Algorithm

Researchers from the Department of Computer Science at the University of Copenhagen have developed an algorithm to find the shortest path in a weighted digraph. The internet and the road network are two classic examples, which can be modeled as a digraph.