Alternatives and similar repositories for dijkstra:

Users that are interested in dijkstra are comparing it to the libraries listed below

• Nerdylicious / DijkstraShortestPath
  Implementation of Dijkstra's algorithm in C++ which finds the shortest path from a start node to every other node in a weighted graph.
  ☆38Updated 5 months ago
• booirror / data-structures-and-algorithm-in-c
  ADT include linked list, stack,queue,tree,etc.
  ☆59Updated 4 years ago
• Mooophy / Path-Planning
  Implementation for A* with stricted visited list, Lifelong Planning A* and D* Lite final version
  ☆91Updated 9 years ago
• crazykeyboard / Graph-AdjList-Dijkstra
  In a adjacent list Graph, find the shortest path between two Nodes by Dijkstra's algorithm.
  ☆12Updated 11 years ago
• ct2034 / cobra
  ☆27Updated 4 months ago
• yangda75 / naiveMAPF
  naive implementations of Multi-Agent Path Finding algorithms
  ☆14Updated 2 years ago
• zijinoier / Hetero-MAPF
  Solve Multi-agent Path Finding problem for heterogeneous robots.
  ☆28Updated 3 years ago
• PathPlanning / SuboptimalSIPP
  Implementation of different versions of Safe Interval Path Planning algorithm that can find bounded-suboptimal solutions.
  ☆28Updated 3 years ago
• PathPlanning / AA-SIPP-m
  Algorithm for prioritized multi-agent path finding (MAPF) in grid-worlds. Moves into arbitrary directions are allowed (each agent is allo…
  ☆112Updated 3 years ago
• vandersonmr / A_Star_Algorithm
  This project contains the implementation of A_Star_Algorithm easily to use in a lot of languages.
  ☆51Updated 4 years ago
• zhujun98 / behavior-and-path-planning
  Self-Driving Car Nanodegree
  ☆15Updated 4 years ago
• arc-l / optimal-mrpp-continuous
  Optimal multi-robot path planning in continuous 2D domain
  ☆23Updated 3 years ago
• Jiaoyang-Li / MAPF-LNS
  Anytime Multi-Agent Path Finding via Large-Neighborhood Search
  ☆57Updated 8 months ago
• Ohohcakester / ENLSVG-Pathfinding
  Edge N-Level Sparse Visibility Graphs for fast optimal Any-Angle Pathfinding
  ☆20Updated 7 years ago
• sourishg / rrt-simulator
  Path planning using RRT
  ☆100Updated 2 years ago
• vampcoder / Artificial-Potential-Field
  Implementation of Artificial Potential Field (Reactive Method of Motion Planing)
  ☆61Updated 7 years ago
• Muon / pyorca
  Python implementation of the ORCA collision avoidance algorithm
  ☆32Updated 4 years ago
• Kei18 / pibt
  Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (IJCAI-19)
  ☆33Updated 3 years ago
• jokla / vrep_car_simulation
  ☆37Updated 7 years ago
• bushuhui / dynamicPathPlanning
  A demo of dynamic path planning
  ☆19Updated 5 years ago
• zhzhang0225 / sampling_based_planners
  Implementation of RRT, RRT-connect, RRT*, and PRM in c++
  ☆9Updated 7 years ago
• eli-b / mapf
  A MAPF framework in C#, with implementations for MA-CBS, ICBS, CBSH, ID, A*, A*+OD, and EPEA*
  ☆43Updated last year
• q576333 / agv_path_smoothing
  A generating/fitting specified NURBS curve ROS package
  ☆42Updated 3 years ago
• Kei18 / time-independent-planning
  Time-Independent Planning for Multiple Moving Agents (AAAI-21)
  ☆13Updated last year
• yangyou95 / POMDP_PBVI_solver
  PBVI C++ Implementation for solving POMDPs
  ☆27Updated 3 years ago
• stdr-simulator-ros-pkg / stdr_simulator
  A simple, flexible and scalable 2D multi-robot simulator.
  ☆96Updated 2 years ago
• anindex / Processing-path_planning
  Implement D*Lite and A* Algorithm on Processing environment
  ☆10Updated 7 years ago
• jansonh / Voronoi
  Fortune's Algorithm in Python
  ☆65Updated 9 years ago
• yan-qi / k-shortest-paths-cpp-version
  An implementation of the k-shorest-paths algorithm in Cpp
  ☆71Updated 2 years ago
• PR2 / pr2_simulator
  ☆30Updated 2 years ago