The ripple-spreading algorithm for the k shortest path tour problem

The project deals with optimizing the algorithm to find the best K shortest paths in a network. It was my final thesis during my undergraduate studies in IIT Madras.

Yens Algorithm and First Fit Implementation made for Optical Networking discipline.

Adapters for C# implementations finding the shortest paths between two locations. This is useful for travel routing when you want to minimize the total time or total distance.

Python code to find the k shortest paths in a kinetic network (Markov chain)

K-Shortest-Path for Apache Tinkerpop

Adapters for Java implementations finding the shortest paths between two locations. This is useful for travel routing when you want to minimize the total time or total distance.

A k-shortest routes algorithm for urban public transportation network

Exploitation des données pour les algorithmes de graphes - appliquée à la région Grand-Est

Implementation of K* k-shortest-paths algorithm

labs for a University course

Traffic assignment

The ripple-spreading algorithm for the k shortest paths problem

Solving the K Shortest Path Problem using a combination of MPI for distributed computing and OpenMP for shared memory parallelization within MPI processes. The goal is to find the Kth shortest path among all nodes of a given graph.

A novel modification to existing k-shortest path algorithms which re-routes drivers with regard to reducing average travel time whilst maintaining fairness

Bidirectional k-shortest paths with DP

Non-overlapping Path Algorithm for Jellyfish network.

Data exploitation for graph algorithms - applied to Paris