yen

Documentation

Overview

Package Yen implements Yen's algorithm for k-shortest paths search in a graph.

Yen's algorithm is made of two components: the shortest path search and the deviation from already found solutions. This package makes use of the DijkstraPath structure to implement the deviation algorithm, while leaves to the developer the choice for the search algorithm. This implementation of Yen's algorithm has been successfully tested using the dijstra bidirectional algorithm provided within the same package.

Index

• func Yen(graph dijkstrastructs.GraphObject, startNode, endNode string, k int, ...) []dijkstrapath.DijkstraPath

Functions

func Yen

func Yen(
	graph dijkstrastructs.GraphObject,
	startNode, endNode string,
	k int,
	searchFunc func(dijkstrastructs.GraphObject, string, string, dijkstrastructs.UnusableEdgeMap) (dijkstrapath.DijkstraPath, bool)) []dijkstrapath.DijkstraPath