This repository provides MATLAB simulations for solving the MicroMouse competition using various algorithms including BFS, DFS, and A*. Explore implementations designed to navigate mazes efficiently, aiming to optimize pathfinding strategies and evaluate their performance in simulated competition environments.

Алгоритмы и структуры данных

My Leetcode Solutions

TOP 200 #Dev 🏆 LeetCode, Solutions in TypeScript, Shell, Database (T-SQL, PL/SQL, MySQL), Concurrency (Python3). @ S. Leschev. Google Engineering Level: L6+

A one-stop Destination✏️ for all your Competitive Programming Resources.

This project tries to solve the problem of distributing students to timetables.

Data Structure and Algorithm

A visualization tool for pathfinding algorithms, including BFS, DFS, and Dijkstra. It also features a maze generator using randomized DFS.

Binary Tree Concepts & Problems

Code interview resources

A general-purpose lightweight C++ graph library

A simple TUI maze with procedurally generated maps using the DFS algorithm. The only objective of the game is to get out

AI Puzzle Solver is a Python application that uses Pygame The main focus is on searching algorithms such as Depth-First Search, Breadth-First Search, A*, Uniform Cost Search, and others

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.

Boggle Solver

🐸 Pattern Algorithms Data Structures in Javascript Astar BFS BellmanFord Combinatorics DFS DijsktrasAlgorithm DisjointSetUnion FenwickSegmentTree FloydWarshall Graph Greedy Algorithm Kruskal Prim Sliding Window Stack TopologicalSort Trie TwoPointers UndirectedGraph 🐸

C++ 课程设计项目，基于 Qt 制作的一个简单的走迷宫小游戏

A path finding algorithms visualizer using a maze with obstacles and empty spaces.

The CFL Reachability problem involves determining whether there is a path in a graph where the concatenation of edge labels along the path forms a string that belongs to a given context-free language.

This project converts a maze into a graph representation and performs various graph-related operations on it.The maze is represented as a 2D array of characters where: "S" indicates the start point, "F" indicates the final (end) point,"E" indicates an empty point, and "-" indicates a wall.