Skip to content

This project uses Dijkstra’s algorithm to find the shortest path among the 10 cities Which can be implemented among any number of cities in the real world.Folium package is used to display the map for better understanding of the path from source to destination.Also, Tkinter GUI is used for user interface and to create a better interaction betwee…

Notifications You must be signed in to change notification settings

gayathri1462/Road-Networking-System

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 

Repository files navigation

ROAD-NETWORKING-SYSTEM

This project uses Dijkstra’s algorithm to find the shortest path among the 10 cities Which can be implemented among any number of cities in the real world.Folium package is used to display the map for better understanding of the path from source to destination.Also, Tkinter GUI is used for user interface and to create a better interaction between the user and our application.

Input:

Output:

alt text

About

This project uses Dijkstra’s algorithm to find the shortest path among the 10 cities Which can be implemented among any number of cities in the real world.Folium package is used to display the map for better understanding of the path from source to destination.Also, Tkinter GUI is used for user interface and to create a better interaction betwee…

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published