yen

package
v0.0.0-...-950f727 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Jan 10, 2014 License: Apache-2.0 Imports: 3 Imported by: 0

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

Constants

This section is empty.

Variables

This section is empty.

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

Types

This section is empty.

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL