Displaying 1 to 13 from 13 results

PathFinding.js - A comprehensive path-finding library for grid based games

  •    Javascript

The aim of this project is to provide a path-finding library that can be easily incorporated into web games. It may run on Node.js or the browser. Note that this project only provides path-finding algorithms for 2D space. If you need to work in a 3D environment, then you may use @schteppe's fork.

valhalla - Open Source Routing Engine for OpenStreetMap

  •    C++

Valhalla is an open source routing engine and accompanying libraries for use with OpenStreetMap data. Valhalla also includes tools like time+distance matrix computation, isochrones, elevation sampling, map matching and tour optimization (Travelling Salesman). Technical documentation for the various components of the library can be found here: docs. Service API documentation as well as links to a variety of technical descriptions are provided within the valhalla-docs repository.

Dijkstra's Solver


Dijkstra's Solver is a teaching and learning tool designed to allow users to plot out graphs, generate the list of steps required to find the shortest path via Dijkstra's Algorithm, and to illustrate those steps. It is developed using the .NET framework, mainly written in C#.

l1-path-finder - 🗺 Fast path planning for 2D grids

  •    Javascript

A fast path planner for grids. The input to the library is in the form of an ndarray. For more information on this data type, check out the SciJS project.

jKstra - JavaScript graph routing library

  •    Javascript

jKstra is a JavaScript library to work with graphs - as in "data structures", with edges and vertices, not as in "graphics". See an interactive demo.

Chinese-Postman - My Python solution to the Chinese-Postman problem.

  •    Python

I wrote this program to solve the Chinese Postman problem. The Chinese Postman Problem, or "route inspection problem" is to find a shortest closed circuit that visits every edge of a (connected) undirected graph.

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

  •    Javascript

dijkstrajs is a simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm. The code was originally written by Wyatt Baldwin and turned into a node module by Thomas Cort.

dijkstra - Fastest golang Dijkstra path finder

  •    Go

Golangs fastest Dijkstra's shortest (and longest) path calculator, requires go 1.6 or above (for benchmarking). go test -bench .

Erdos - modular and modern graph-theory algorithms framework in Java

  •    Java

Erdos is a very light, modular and super easy to use modern Graph theoretic algorithms framework for Java. It contains graph algorithms that you can apply swiftly with one line of code and was primarily developed to back a worker manager tasks for various Java projects including one in Android. Erdos was born because other frameworks in Java were very hard to get started with or just plain heavy (overhead wise) or just too opinionated. Erdos let the developer design it's own graph engines to optimise the runtime and comes with all of the graph algorithms you can expect.

kamal - A routing engine service using Open Street Maps and GTFS as data source

  •    Clojure

A routing engine and API service based on Open data. Its current focus are flexibility, speed and stability in that order. For a demo see try.hyposfer.com (it will take a few seconds on the first run).