27 Open source projects that are alternatives of or similar to Node Dijkstra

Data Structures and Algorithms in Java

Fastest golang Dijkstra path finder

Open Source Routing Engine for OpenStreetMap

modular and modern graph-theory algorithms framework in Java

A collection of algorithms and data structures

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

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

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

MATLAB sample codes for mobile robot navigation

Pathfinding library for rust

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.

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

Dijkstra's Pathfinding Algorithm Unity Implementation. (Not being maintained by me, it is just an experiment.)

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

Graph processing library

A pathfinder visualizer in Flutter. Create mazes, generate random walls, or draw your own walls and see the pathfinding algorithms in action

The Repository is All about the Graph Algorithms. I am Still Working On it. I am trying to Note down all the variations of Popular graph Algorithms. I am also keeping the solution to the problems of Different Online Judges according to the topic. I hope you can find it useful.

A Julia package for downloading and analysing geospatial data from OpenStreetMap APIs.

开源中文分词工具包，中文分词Web API，Lucene中文分词，中英文混合分词

Contains coursera robotics specialization assignment codes

A Python wrapper of pgRouting for routing from nodes to nodes on real map.

Website built using React Framework for visualizing Pathfinding and Maze Generation Algorithms.

Graph algorithms in lua

Vim plugin to suggest better movements

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

Common data structures and algorithms implemented in JavaScript