Finds the shortest path from two cities in Europe using Dijkstra's Minimum Cost Path Algorithm. Cities come from a map stored as a graph which is implemented as a an External Adjacency Matrix