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

Exact geodesic for triangular meshes implemented by Danil Kirsanov

Algorithms Course Repo

Experimental OSM based route planner for electric vehicles with realistic consumption model aimed at research

A collection of python utilities for mesh processing

GNURadio implementation of the lazy Viterbi algorithm

An interactive program in which you can follow A* or Dijkstra's pathfinding algorithm step by step

A clean and common C++ code base to build both executable and shared library of DTALite across platforms.

Implementation of all the Data Strucuture & Algorithms learnt during CP and undergrad life

the route planner that generate an optimized route that covers all the desired locations, suggesting the best sequence to follow

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

Maze generation, solving & finding shortest paths algorithms with backtracking, written in C++ and SFML.

Simulation of a service which provides the users with the best path from one point to another, taking into account various aspects such as time, distance and expenditure, developed in the Algorithm Design and Analysis (CAL) class.

Clone from http://degroup.cis.umac.mo/sspexp/, the implementation of the VLDB'17 paper An Experimental Study on Hub Labeling based Shortest Path Algorithms.

An abstract graph C++ library

This is a project to calculate the price of a metro ticket using (Graph Theory, BFS and Shortest Path).