Visualization of various algorithms in computer science.

Pathfinding and Maze Visualization Tool

It allows users to visualize the behavior of two popular pathfinding algorithms: A* (A-star) and BFS (Breadth-First Search). The tool features an intuitive graphical interface where users can interactively set up obstacles and start points, then watch in real-time as the algorithms calculate and display the shortest path.

Pathfinding Visualizer is an application that allows users to visualize various pathfinding algorithms in action. Pathfinding Visualizer currently supports Dijkstra's algorithm, Breadth First Search and Depth First Search.

Pathfinding Algorithm Visualizer

Interactive pathfinder application built as a university assignment work. Dijkstra, A* and JPS!

djikstra's pathfinding algorithm visualized in python

A* / A-Star Search Algorithm

[Rebuild] Snake Remake 🐍 is an upgraded edition of my past project, 'Unconventional Snake Xenia.' It's an AI-driven snake game featuring a custom neural network. 🧠 The menu-driven interface offers visualizations of different pathfinding algorithms! 🎮

Visualisation of pathfinding algoritm made with typescript, react and html canvas.

Visualizations of several most popular pathfinding algorithms (Dijkstra's algorithm, A* search etc.)

A browser game where pathfinding algorithms race against each other!

A non-trivial DevOps project example using breadth-first search to find a path through a grid map. Webpage deployed with Streamlit Cloud.

3D maze pathfinding visualization [s!]

A C# WinForms application to visualize and explore pathfinding algorithms

Explore the fascinating world of pathfinding algorithms with this interactive Pathfinding Visualizer built in Python using Pygame. This project provides a graphical representation of pathfinding algorithms on a grid, allowing users to experiment, visualize, and gain insights into the efficiency of different algorithms.

This program is a visualizer of different pathfinding algorithms. It will show how the algorithms search by visualzing each iteration and shows the shortest path to the end cell once found. You can also add obstacles like walls to see how it affects the search.