A collection of algorithms and data structures

Open source routing engine for OpenStreetMap. Use it as Java library or standalone web server.

Open Source Routing Engine for OpenStreetMap

Implementation of Algorithms and Data Structures, Problems and Solutions

Using Dijkstra's algorithm ("finding the shortest paths between nodes in a graph") to draw maps 🌍.

Pathfinding library for rust

MATLAB sample codes for mobile robot navigation

Motion planning and Navigation of AGV/AMR：python implementation of Dijkstra, A*, JPS, D*, LPA*, D* Lite, (Lazy)Theta*, RRT, RRT*, RRT-Connect, Informed RRT*, ACO, Voronoi, PID, DWA, APF, LQR, MPC, RPP, DDPG, Bezier, Dubins etc.

Competitive Programming templates that I used during the past few years.

This repository contains path planning algorithms in C++ for a grid based search.

Motion planning and Navigation of AGV/AMR：matlab implementation of Dijkstra, A*, Theta*, JPS, D*, LPA*, D* Lite, RRT, RRT*, RRT-Connect, Informed RRT*, ACO, Voronoi, PID, LQR, MPC, APF, RPP, DWA, DDPG, Bezier, B-spline, Dubins, Reeds-Shepp etc.

BFS, Greedy Best-First Search, Dijkstra and A* path finding algorithms

Hipster4j is a lightweight and powerful heuristic search library for Java and Android. It contains common, fully customizable algorithms such as Dijkstra, A* (A-Star), DFS, BFS, Bellman-Ford and more.

Vim plugin to suggest better movements

路径规划算法，A*，A-star启发搜索，Hybrid-A*，混合A*算法，Dijkstra迪杰斯特拉算法，GBFS贪婪最佳优先搜索算法，DFS深度优先搜索，BFS广度优先搜索算法等，车辆路径规划算法，小黑子路径规划

Common data structures and algorithms implemented in JavaScript

Visual explanation of pathfinding algorithms and how a*, Dijkstra and BFS can be seen as the same algorithm with different parameter/data structures used under the hood

Fastest golang Dijkstra path finder

A NodeJS implementation of Dijkstra's algorithm

Package provides javascript implementation of algorithms for graph processing