Skip to content

Simulation of Uber App using Dijkstra and Floyd-Warshall to calculate the shortest path between two nodes.

Notifications You must be signed in to change notification settings

GabieSB/UberApp

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

27 Commits
 
 
 
 
 
 

Repository files navigation

UberUNA

This aplication is a small simulation of Uber. The program can calculate the shortest path using Dijkstra or Floyd and will both the path and the car to the user . During the process of the car to arrives the destination place the user user could put and see an accident simulation and how the path is recalculated

About

Simulation of Uber App using Dijkstra and Floyd-Warshall to calculate the shortest path between two nodes.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors 3

  •  
  •  
  •