Implement Yen's Algorithm for K-Shortest Paths

Description

Yen's Algorithm is a widely used algorithm for finding the K shortest paths between two nodes in a graph. This feature would be a valuable addition to the graph algorithms module, enabling users to find multiple alternative paths, which is useful in applications like network routing, transportation planning, and logistics.