17 results found Sort:

607
3.4k
mit
168
Implementation of Algorithms and Data Structures, Problems and Solutions
Created 2016-12-16
612 commits to master branch, last one 5 years ago
A visualizer for pathfinding algorithms in 3D with maze generation, first-person view and device camera input.
Created 2020-08-01
55 commits to master branch, last one 4 years ago
87
325
apache-2.0
27
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.
Created 2013-04-01
763 commits to 1.0.X branch, last one 3 years ago
24
278
apache-2.0
8
Fast shortest path calculations for Rust
Created 2019-06-17
53 commits to master branch, last one 11 months ago
32
240
gpl-3.0
7
Interface between R and the OpenStreetMap-based routing service OSRM
Created 2015-09-11
354 commits to master branch, last one 14 days ago
Common data structures and algorithms implemented in JavaScript
Created 2016-06-21
138 commits to master branch, last one 3 years ago
Fastest golang Dijkstra path finder
Created 2017-01-02
83 commits to master branch, last one 10 months ago
17
129
unknown
6
Distances on Directed Graphs in R
Created 2017-07-25
2,130 commits to main branch, last one 3 days ago
Modular and modern graph-theory algorithms framework in Java
Created 2017-02-08
53 commits to master branch, last one about a year ago
9
113
unknown
5
Algorithms for Routing and Solving the Traffic Assignment Problem
Created 2019-06-01
150 commits to master branch, last one 21 days ago
8
74
mpl-2.0
10
AStarix: Fast and Optimal Sequence-to-Graph Aligner
Created 2019-11-12
213 commits to master branch, last one 3 years ago
Parallel Implementation of Bellman Ford Algorithm
Created 2018-01-04
5 commits to master branch, last one 2 years ago
31
60
apache-2.0
3
An open-source, cross-platform, lightweight, and fast Python path engine for networks encoded in GMNS.
Created 2021-01-03
656 commits to master branch, last one 21 days ago
Dart implementation of a directed graph. Provides algorithms for sorting vertices, retrieving a topological ordering or detecting cycles.
Created 2020-03-31
335 commits to main branch, last one 5 months ago
7
52
apache-2.0
5
Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.
Created 2019-05-24
347 commits to master branch, last one about a year ago