A react Application Used to visualize classical path finding algorithms like BFS, DFS, Dikstra's, A-star

Generazione di un labirinto con un algoritmo di Depth-first search.

It is a web app made with cytoscapejs that allows the visualization and execution of graph algorithms with the sweetness of a bunch of grapes. It is very easy to learn graph algorithms with this tool.

The Mars Colonization Program in Engage 2020, with Microsoft and Acehacker. Team Code Brewers from IIT Kharagpur.

Generation maze using different Algoritms

Soluciones en c++ y c# de algunos problemas sobre Teoría de Grafos.

AlgoPipe is a fast, lightweight visual pipeline editor built with React, Tailwind, FastAPI, and Pydantic. Easily drag and drop nodes to build intelligent workflows, with real-time cycle detection to ensure your graph remains a valid Directed Acyclic Graph (DAG). Ideal for no-code tools, data processing flows, and LLM-based pipelines.

Shortest Path Finder, a minor project which gives optimal path from source to destination

A grid-based pathfinding algorithm visualizer that also explains what the algorithms are doing step-by-step

Solutions for Leetcode, Codewars, Hackerrank, Structy, and other platforms.

Solving AI Problems with JavaScript

React-based web application to visualize Path Finding algorithms like Dijkstra, BFS, and DFS.

An open-source project using JavaScript and the Depth-First Search (DFS) algorithm to illustrate the connections between the curricular components of some IFPB degrees

Educational tool for visualizing graph algorithms, built with React and D3.js (ReaGraph). Helps students understand algorithms like Dijkstra, BFS, and DFS through interactive, step-by-step visualizations.

Typescript maze generator

💡 Maze Emulator With HTML5 Canvas API

Alice, a simple and performant data structure for bipartite graphs with integer values as vertices.

BFS, DFS(Recursive & Iterative), Dijkstra, Greedy, & A* Algorithms. These algorithms are used to search the tree and find the shortest path from the starting node to the goal node in the tree.

Custom Maze Generation with DFS and Finding Shortest Path

Find Shortest Path To Exit (using Breadth First Search algorithm) with dynamic setting of Obstacles , Start Point and Exit Point .