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

Interface between R and the OpenStreetMap-based routing service OSRM

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

Algorithms for Routing and Solving the Traffic Assignment Problem

GraphMat graph analytics framework

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

Algorithms in python and C

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

Some Python code to make GIFs from graph algos

AStarix: Fast and Optimal Sequence-to-Graph Aligner

Parallel Implementation of Bellman Ford Algorithm

Graph algorithms in lua

An open-source, cross-platform, lightweight, and fast Python path engine for networks encoded in GMNS.

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

Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.

python package for fast shortest path computation on 2D polygon or grid maps

A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.

Source code for the HappyCoders.eu articles on pathfinding and shortest path algorithms (Dijkstra, A*, Bellman-Ford, Floyd-Warshall).

Notebook for quick search

Using reinforcement learning to find the shortest paths.

Pathfinding Visualizer application that visualizes graph based search algorithms used to find the shortest path. Algorithms used: Breadth first search, Depth first search, Best first search and A* search made with java swing

Given a fleet of drones, a list of customer orders, and availability of the individual products in warehouses, schedule the drone operations so that the orders are completed as soon as possible.

SAP HANA includes a graph engine for network analysis. The examples demonstrate the usage of built-in algorithms, e.g. for path finding.