Skip to content

Find the best path between any two cities using Dijkstra's algorithm - College Project

Notifications You must be signed in to change notification settings

g-brrzzn/JavaMaps

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

JavaMaps

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.

Captura de tela 2024-06-23 222408

About

Find the best path between any two cities using Dijkstra's algorithm - College Project

Resources

Stars

Watchers

Forks

Languages