shortest-path-finder

Welcome to find shortest path (using Dijkstra's Shortest Path Algorithm) between Dutch cities shown below:

Amsterdam

Utrecht

Groningen

Haarlem

Arnhem

's-Hertogenbosch

Maastricht

Zwolle

Leeuwarden

Lelystad

Assen

Middelburg

Path Finding Example

You can use the shortest-path-finder by running this java app with given source and destination cities.

Please give source(i.e. Amsterdam) and destination(i.e. Maastricht) as command line arguments!

(input) -> java ShortestPathFinder.java Amsterdam Maastricht

(output) -> The shortest path is:

Amsterdam -> Utrecht -> 's-Hertogenbosch -> Maastricht

-> Total distance is:

236 km