Yen k shortest paths

[ArpitaHanjagi]

Algorithm: Yen's K Shortest Paths

Purpose: Finds the K shortest loopless paths between a source and target in a weighted directed graph.

Theory:

Starts with the shortest path using Dijkstra.

Iteratively generates alternative paths by deviating from previous paths.

Avoids cycles in paths.

Time Complexity: O(K * V * (V + E) * log V) with Dijkstra for each deviation.

Space Complexity: O(K * V).

Input: Weighted directed graph (adjacency list), source, target, K.

Output: List of K paths and their total distances.

[github-actions[bot]]

This PR is stale because it has been open 30 days with no activity. Remove stale label or comment or this will be closed in 7 days.

[github-actions[bot]]

This PR was closed because it has been stalled for 7 days with no activity.