dijkstra
Unity-PathFindingAlgorithms
BFS, Greedy Best-First Search, Dijkstra and A* path finding algorithms
- 394
- C#
- MIT
- 7 y ago
hipster
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.
- 333
- Java
- Apache-2.0
- 3 y ago
pathfinding
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
- 184
- JavaScript
- 5 y ago
gograph
Generic graph data structures and algorithms for Go (Golang): dependency graphs (DAGs) with cycle checks and topological sort, BFS and DFS traversal, Dijkstra and other shortest paths, connectivity and partitioning. No dependencies.
- 150
- Go
- Apache-2.0
- 1 d ago
Algorithms
Algorithms (Graph/Sort/Search) implemented from scratch in Kotlin. Built for learning, interview preparation, and understanding how common algorithms work.
- 163
- Kotlin
- 2 wk ago
Algorithm-Visualizer
Visualize working of famous algorithms, Currently Implemented Path Finding (Dijkstra's, A Star, BFS, DFS) Sorting (Bubble, Insertion, Selection, Merge, Quick, Heap)
- 79
- JavaScript
- MIT
- 6 y ago
dijkstrajs
A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.
- 49
- JavaScript
- 4 y ago
PythonPDDL
A dependency-free, pure-Python PDDL planning framework: parser, grounder, classical-to-SOTA planners, heuristics and a benchmarking harness
- 37
- Python
- Apache-2.0
- 13 d ago
psycopgr
A Python wrapper of pgRouting for routing from nodes to nodes on real map.
- 29
- Python
- MIT
- 10 h ago
algorithms
Algorithms and Data Structures a comprehensive collection of fundamental Algorithms and Data structures organized into various categories to cater to the needs of software engineers and computer science students.
- 15
- Java
- MIT
- 23 mo ago
dijkstra-shortest-path
Implementation of Dijkstra's shortest path algorithm in python. a greedy algorithm for finding the shortest path from a specific source node to any other target node in a weighted graph
- 1
- Python
- 5 y ago




