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.

Fast shortest path calculations for Rust

Shortest Paths and Travel Time from OpenStreetMap with R

Common data structures and algorithms implemented in JavaScript

Coursera's Data Structures and Algorithms Specialization

modular and modern graph-theory algorithms framework in Java

Fastest golang Dijkstra path finder

Distances on Directed Graphs in R

A visualizer for pathfinding algorithms in 3D with maze generation and first-person view

GraphMat graph analytics framework

Some Python code to make GIFs from graph algos

Fast implementation of Dijkstra algorithm in R

AStarix: Fast and Optimal Sequence-to-Graph Aligner

Graph algorithms in lua

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

Algorithms in python and C

Parallel Implementation of Bellman Ford Algorithm

Notebook for quick search

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

All the Famous algorithms you need!

Just a simple site that lets you find buses from A to B in Colombo. Find a newer JS version here: https://github.com/janithl/BusRouteJS

A JS rewrite of the original bus route finder.

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

Cobweb is a multi-modal journey planner offering a server based REST API and a light frontend.

Solving Elementary Longest/Shortest Path problems with Integer Programming

Android App for simulating Dijkstra and A* algorithms through intuitive animations

Routing algorithm for a drone delivery system.

Convert Shapefile to the Network and find number of shortest paths