shortest-paths

Implementation of Algorithms and Data Structures, Problems and Solutions

A visualizer for pathfinding algorithms in 3D with maze generation, first-person view and device camera input.

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.

Fast shortest path calculations for Rust

Shortest Paths and Travel Time from OpenStreetMap with R

Common data structures and algorithms implemented in JavaScript

Fastest golang Dijkstra path finder

Coursera's Data Structures and Algorithms Specialization

Distances on Directed Graphs in R

Modular and modern graph-theory algorithms framework in Java

GraphMat graph analytics framework

Algorithms for Routing and Solving the Traffic Assignment Problem

Algorithms in python and C

Some Python code to make GIFs from graph algos

Java Code for Contraction Hierarchies Algorithm, A-Star Algorithm and Bidirectional Dijkstra Algorithm. Tested and Verified Code.

AStarix: Fast and Optimal Sequence-to-Graph Aligner

Graph algorithms in lua

Laboratory problems and solutions for the ITMO course "Algorithms and data structures"

Dart implementation of a directed graph. Provides algorithms for sorting vertices, retrieving a topological ordering or detecting cycles.

Parallel Implementation of Bellman Ford Algorithm