-
Notifications
You must be signed in to change notification settings - Fork 0
This C++ project implements an Emergency Travel Planning System using graph theory's adjacency lists, employing BFS and DFS for efficient city navigation. It optimizes routes based on user preferences for minimizing travel time or cost, with dynamic memory management for city and route data.
areeba0/Emergency-Travel-Plan-using-Adjacency-Lists-and-BFS-DFS-Algorithms
ErrorLooks like something went wrong!
About
This C++ project implements an Emergency Travel Planning System using graph theory's adjacency lists, employing BFS and DFS for efficient city navigation. It optimizes routes based on user preferences for minimizing travel time or cost, with dynamic memory management for city and route data.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published