dijkstra

A collection of algorithms and data structures

Open source routing engine for OpenStreetMap. Use it as Java library or standalone web server.

Implementation of Algorithms and Data Structures, Problems and Solutions

Open Source Routing Engine for OpenStreetMap

Using Dijkstra's algorithm ("finding the shortest paths between nodes in a graph") to draw maps 🌍.

Pathfinding library for rust

MATLAB sample codes for mobile robot navigation

Competitive Programming templates that I used during the past few years.

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.

This repository contains path planning algorithms in C++ for a grid based search.

Vim plugin to suggest better movements

BFS, Greedy Best-First Search, Dijkstra and A* path finding algorithms

Common data structures and algorithms implemented in JavaScript

Visual explanation of pathfinding algorithms and how a*, Dijkstra and BFS can be seen as the same algorithm with different parameter/data structures used under the hood

Fastest golang Dijkstra path finder

A NodeJS implementation of Dijkstra's algorithm

Package provides javascript implementation of algorithms for graph processing

Data Structures and Algorithms in Java

Modular and modern graph-theory algorithms framework in Java

Graph processing library