Skip to content

Algorithm of search of smaller route, using Dijkstra

Notifications You must be signed in to change notification settings

Phomint/Dijkstra

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 

Repository files navigation

Dijkstra

Algoritmo de dijkstra, busca de menor distância entre cidades, para criar a matriz em um arquivo do tipo 'txt', deve seguir a sintaxe de matriz=[origem, destino, distancia] sendo ex: SaoPaulo Sorocaba 100.0.

About

Algorithm of search of smaller route, using Dijkstra

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages