Implementation of Algorithms and Data Structures, Problems and Solutions
-
Updated
Oct 27, 2023 - Java
Implementation of Algorithms and Data Structures, Problems and Solutions
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.
Coursera's Data Structures and Algorithms Specialization
A visualizer for pathfinding algorithms in 3D with maze generation, first-person view and device camera input.
Common data structures and algorithms implemented in JavaScript
GraphMat graph analytics framework
Algorithms in python and C
Laboratory problems and solutions for the ITMO course "Algorithms and data structures"
Fastest golang Dijkstra path finder
Interface between R and the OpenStreetMap-based routing service OSRM
Notebook for quick search
Java Code for Contraction Hierarchies Algorithm, A-Star Algorithm and Bidirectional Dijkstra Algorithm. Tested and Verified Code.
Fast shortest path calculations for Rust
An open-source, cross-platform, lightweight, and fast Python path engine for networks encoded in GMNS.
Source code for the HappyCoders.eu articles on pathfinding and shortest path algorithms (Dijkstra, A*, Bellman-Ford, Floyd-Warshall).
All the Famous algorithms you need!
Distances on Directed Graphs in R
Parallel Implementation of Bellman Ford Algorithm
Modular and modern graph-theory algorithms framework in Java
Some Python code to make GIFs from graph algos
Add a description, image, and links to the shortest-paths topic page so that developers can more easily learn about it.
To associate your repository with the shortest-paths topic, visit your repo's landing page and select "manage topics."