🐍🍎 This repository contains a JavaScript implementation of a Breadth-First Search (BFS) based pathfinding algorithm for the classic Snake game. The script automatically plays the game, guiding the snake towards the food while avoiding collisions with its own body and the walls.

A* / A-Star Search Algorithm

This is a visualizer that finds the shortest path from a source to a destination, built using HTML, CSS, JavaScript, React.js, and data structures and algorithms (DSA). Here Dijkstra's algorithm is used to find the shortest path. This is the same type of technology used by google maps

Path Finder shows how path finding algorithms such as Breadth-first search, Depth-first search, dijkstra algorithm and a* works.

This project is a visual representation of Dijkstra's algorithm that enables users to observe its step-by-step operation and experiment with different graphs and obstacles.

This is a Project which will visualize different PathFinding Algorithms

This project has been created for A* algorithm implementation in Python 3 and Pyp5js is used to visualize that algorithm.

Visualizer for Pathfinding Algorithms

Web application for analyzing graph search algorithms

A visualizer to visualize path fining algorithms like A* and Dijkstra, and the maze generating algorithms like Prim's and Kruskal's. This visualizer is created by react.js.

O projeto é uma aplicação web que utiliza o algoritmo de Dijkstra para encontrar o caminho mais curto entre dois pontos em um mapa

a pathfinder app, that allows user to draw a path in 10x10 grid and return shortest distance between 2 points

Visualizes shortest path finding algorithms on a grid

Path finding visualization

maze generator and pathfinding visualizer

Self-playing snake game implemented using A* pathfinding.

Live Site

A web application to visualize various shortest path algorithms.

A pathfinding-visualizer web application built using react-redux

Visualization tool for Pathfinding algorithms such as Dijkstra and A* using Reactjs library.