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

Algorithms in python and C

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

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

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

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