Implementing Reinforcement Learning, namely Q-learning and Sarsa algorithms, for global path planning of mobile robot in unknown environment with obstacles. Comparison analysis of Q-learning and Sarsa

Given a list of simple obstacle polygons, build the visibility graph and find the shortest path between two points

Rust re-implementation of OpenFST - library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). A Python binding is also available.

A very simple A* implementation in C++ callable from Python for pathfinding on a two-dimensional grid.

Graph processing library

Codes to do raytracing for geophysical applications

BCP-MAPF – branch-and-cut-and-price for multi-agent path finding

Dijkstra's Shortest Path for 6, 18, and 26-Connected 3D (Volumetric) Image Volumes

A simple graph library

Modelling marine traffic in the ice-covered Baltic Sea using AIS data

Path finding on a 2D polygonal map

Unpaired Image-to-Image Translation with Shortest Path Regularization

DataStructures and algorithms

Accurate routing for OpenStreetMap/OSMnx

python package for fast shortest path computation on 2D polygon or grid maps

ClickGraph is an open-source graph query service layer for ClickHouse, written in Rust, turning an existing ClickHouse database into a graph view in minutes. It also provides an embedded mode with chdb, now supporting writes.

This repository contains all the algorithms implementation & problems solution, assignment solution, Interview question solution & other related materials (Slides, Resources) related to Princeton University algorithms Part I & II course at COURSERA

A train profile for OSRM

A Julia package for operations research problems

See how visibility graphs work in an interactive way using Pyvisgraph and Pygame