Depth-first search

This Python code employs the Depth-First Search (DFS) algorithm to find a path from "Arad" to "Bucharest" in the Romania map. It uses a priority queue, backtracking, and a graph representation. The DFS path is printed at the end. Skills demonstrated include graph traversal, priority queue usage, and DFS algorithm implementation.

A Go Generics implementation of depth-first search algorithms

Breadth First Search and Depth First Search in a 2D maze.

The goal of this project is to generate mazes (done in a reasonable amount of time), solve them (from 4 different ways and done in a reasonable amount of time), and print the solution.

Protects recursive functions processing collections from infinite recursion