Shortest Path Problem

Shortest Path Problem

4/5
(1 votes)

Many applications in different domains need to calculate the shortest-path between two points in a graph.

In this paper we describe this shortest path problem in detail, starting with the classic Dijkstra's algorithm and moving to more advanced solutions.

First published
2014
Publishers
Morgan & Claypool Publishers

Books

Similar books