Publisher's Synopsis
In the society we live in we are always looking for ways to reduce our expenses, this includes financial resources and the most precious, our time. In a trip we need to determine routes and choose the most profitable one, this process demands calculation of cost and time that will be spent. In this line of reasoning, Dijkstra's algorithm is the most famous algorithm for calculating the minimum cost path between vertices of a graph, and, in practice, the most used. This work aims to apply the Dijkstra algorithm in order to obtain the optimization of the path between municipalities in several Brazilian states.
