search

jlcrodrigues / Transport-Navigator

CLI project. Manage a bus network and navigate trough it.
MIT License
2 stars 0 forks source link

Shortest distance algorithm #10

Closed jlcrodrigues closed 2 years ago

jlcrodrigues commented 2 years ago

In the graph class create a method to calculate the path with the shortest distances. This can be done with either prim or kruskal algorithms. Use the - opertor from position to calculate distances.