https://github.com/queraltsm/hospitalshortestpath

Dijkstra and Floyd-Warshall algorithm to calculate the shortest path between hospitals
https://github.com/queraltsm/hospitalshortestpath

dijkstra-shortest-path floyd-warshall-algorithm shortest-path

Last synced: 3 months ago
JSON representation

Dijkstra and Floyd-Warshall algorithm to calculate the shortest path between hospitals

• Host: GitHub
• URL: https://github.com/queraltsm/hospitalshortestpath
• Owner: queraltsm
• Created: 2019-06-21T13:48:29.000Z (about 6 years ago)
• Default Branch: master
• Last Pushed: 2019-06-21T13:50:55.000Z (about 6 years ago)
• Last Synced: 2025-01-28T19:35:39.931Z (5 months ago)
• Topics: dijkstra-shortest-path, floyd-warshall-algorithm, shortest-path
• Language: Python
• Size: 1000 Bytes
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
Hospital Shortest Path

Dijkstra and Floyd-Warshall algorithm to calculate the shortest path between hospitals





![Captura de pantalla 2019-02-22 a las 12 11 01](https://user-images.githubusercontent.com/26334453/59927202-d3d97e80-9433-11e9-9ebe-1b2e20d1b2cc.png)





![Captura de pantalla 2019-02-22 a las 12 51 25](https://user-images.githubusercontent.com/26334453/59927207-d63bd880-9433-11e9-8cbe-60d6ac7f59f7.png)