Application of graph theory and Dijkstra's algorithm to find both the shortest distances and the shortest paths in a city

The route map of Santa Rose de Cabal city is presented as a geometric digraph (the nodes are the intersections of the ways, and the streets joining these nodes are the arcs). This digraph is represented as a matrix of weights of arcs, which uses the Dijkstra algorithm to determine the shortest distances between nodes (taking each node as a source node), and the route to go from node to node. The results genrated by the Dijkstra algorithm are expressed in a matrix which has been called matrix of minimal distances between nodes.