Skip to content
#

depth-first-search

Here are 92 public repositories matching this topic...

C++ implementation of some of the most well-known graph algorithms in the simplest way. Mostly in non-OOP style because the algorithms itself and its performance were the main points.

  • Updated Sep 21, 2022
  • C++

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.

  • Updated Jun 16, 2024
  • C++

Improve this page

Add a description, image, and links to the depth-first-search 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 depth-first-search topic, visit your repo's landing page and select "manage topics."

Learn more