There are 2 repositories under dijkstra topic.
A collection of algorithms and data structures
Open source routing engine for OpenStreetMap. Use it as Java library or standalone web server.
Using Dijkstra's algorithm ("finding the shortest paths between nodes in a graph") to draw maps :earth_africa:.
Pathfinding library for rust
MATLAB sample codes for mobile robot navigation
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: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.
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.
BFS, Greedy Best-First Search, Dijkstra and A* path finding algorithms
Vim plugin to suggest better movements
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.
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*,A-star启发搜索,Hybrid-A*,混合A*算法,Dijkstra迪杰斯特拉算法,GBFS贪婪最佳优先搜索算法,DFS深度优先搜索,BFS广度优先搜索算法等,车辆路径规划算法,小黑子路径规划
A NodeJS implementation of Dijkstra's algorithm
Package provides javascript implementation of algorithms for graph processing
Modular and modern graph-theory algorithms framework in Java
Data Structures and Algorithms in Java
Dijkstra's Pathfinding Algorithm Unity Implementation. (Not being maintained by me, it is just an experiment.)
Collection of maze generation algorithms.
Visualize working of famous algorithms, Currently Implemented Path Finding (Dijkstra's, A Star, BFS, DFS) Sorting (Bubble, Insertion, Selection, Merge, Quick, Heap)
Contains coursera robotics specialization assignment codes
Dijkstra's Shortest Path for 6, 18, and 26-Connected 3D (Volumetric) Image Volumes
Website built using React Framework for visualizing Pathfinding and Maze Generation Algorithms.
A Julia package for downloading and analysing geospatial data from OpenStreetMap APIs.
Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.
Classical robotics algorithms implemented in C++17.
A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.