An asychronous A* pathfinding library for serverside minecraft development

Implementation of common pathfinding algorithms

modified A* path planner in RVIZ2 for visualizing robot navigation. by creating two points you are able to create the best path planner.

Improved version of A*, aka JPS

An implementation of several Pathfinding algorithms with a basic gui in python

General purpose library for multithreaded Rapidly Random exploring Trees

Unity Pathfinders Visualized is a Unity project that visualizes fundamental pathfinding algorithms. It features Breadth-First Search (BFS) for efficient pathfinding in unweighted graphs, Depth-First Search (DFS) for deep exploration useful in maze generation, and Swarm Pathfinding, an alternative approach inspired by swarm behavior.

BrainAI is a set of helper classes to add AI to your game.

Showcasing popular algorithm visualizations.

A fast pathfinder that traverses randomly and self-optimizes.

This project aims to maximize path length in a grid by fitting pentominoes and selecting start and end positions, always choosing the shortest path. Three approaches have been explored so far: brute force, pathfinding algorithms, and MILP-based optimization.

Visualization of various algorithms in computer science.

Web application for analyzing graph search algorithms

Easy & Efficient Path Finding Library in Python

React/TypeScript app for beautifully visualizing pathfinding and maze-generation algorithms.

it finds path

Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)

simple path finding / a star code.

Graph demo applications. Path finding, space-filling curves.

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