A collection of algorithms (including Yen, Eppstein, and Lazy Eppstein) to compute the K shortest paths between two nodes in a weighted, directed graph, implemented in Java.

🦜 DISCOTRESS 🦜 is a software package to simulate and analyse the dynamics on arbitrary Markov chains

Implements K shortest path algorithms for networkx

C++ Alternative Routing Library for Boost.Graph. A configurable, efficient, plug-n-play solution for alternative route planning and k-shortest paths problems.

Bidirectional k-shortest paths with DP

Data exploitation for graph algorithms - applied to Paris

Implementation of K* k-shortest-paths algorithm

Non-overlapping Path Algorithm for Jellyfish network.

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.

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 k-shortest routes algorithm (implemented in MATLAB)

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

A k-shortest routes algorithm for urban public transportation network

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

labs for a University course

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

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.