Python-based pathfinding simulator visualizing Dijkstra, Bellman-Ford, Depth First Search, Breadth First Search Algorithms in a dynamic environment.
-
Updated
Jan 18, 2026 - Python
Python-based pathfinding simulator visualizing Dijkstra, Bellman-Ford, Depth First Search, Breadth First Search Algorithms in a dynamic environment.
This is to develop a terminal based application which generates a random maze which find the path from Start to end and visualizes and path in the terminal with turtle modules.
Searching Algorithm Example
Recursive DFS solver for subset sum problem.
This is a Java application to detect Acyclic graphs
5 Python projects I did demonstrating knowledge of concepts in graphs & trees and their use cases.
Production-ready e-commerce REST API built with Node.js, Express.js, TypeScript, Prisma, PostgreSQL, Redis, JWT authentication, RBAC, and DFS-powered hierarchical category filtering.
To associate your repository with the depth-first-search-algorithm topic, visit your repo's landing page and select "manage topics."