Animal Chess
Python-based pathfinding simulator visualizing Dijkstra, Bellman-Ford, Depth First Search, Breadth First Search Algorithms in a dynamic environment.
Searching Algorithm Example
🤖 Simulate robot navigation to find optimal paths in various traffic conditions using efficient algorithms like Dijkstra and Bellman-Ford.
The solution for the assignment on https://www.theodinproject.com/lessons/javascript-knights-travails.
5 Python projects I did demonstrating knowledge of concepts in graphs & trees and their use cases.
Developed a maze-solving script in Python, employing the breadth-first search (BFS) algorithm to determine the shortest path between two points within a maze. Implemented the project using the curses library for user interface and visualization.
Harvard University CS50’s Introduction to Artificial Intelligence with Python (2025)
This repository stores my python solutions to programming challenges that I have found from various sources.
Master's | Basic Algorithms & Data structures | Final Project
Reads a .txt file of city-to-city flights and uses Breadth-First Search (BFS) to determine if a path exists between two locations. Highlights file I/O, graphs, and queue-based traversal.
Add a description, image, and links to the breadth-first-search-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the breadth-first-search-algorithm topic, visit your repo's landing page and select "manage topics."