Skip to content
#

travel-planning-and-path-finding

Star

Here is 1 public repository matching this topic...

areeba0 / Emergency-Travel-Plan-using-Adjacency-Lists-and-BFS-DFS-Algorithms

Star 1

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.

cpp data-structures adjacency-lists breadth-first-search minimum-spanning-trees depth-first-search optimization-algorithms cost-optimization dynamic-memory-allocation speed-optimization travel-planning-and-path-finding
  • Updated Jun 16, 2024
  • C++

Improve this page

Add a description, image, and links to the travel-planning-and-path-finding topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the travel-planning-and-path-finding topic, visit your repo's landing page and select "manage topics."

Learn more