This Java project implements a graphical user interface (GUI) for managing and navigating a city graph. The graph represents cities connected by roads, where each road has an associated distance and toll cost. The project allows users to add and remove cities and roads, and to find the shortest or cheapest path between any two cities using Dijkstra's algorithm.
-
Notifications
You must be signed in to change notification settings - Fork 0
g-brrzzn/JavaMaps
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Find the best path between any two cities using Dijkstra's algorithm - College Project