K-Shortest Path 1.0

This function is based on Yen's k-Shortest Path algorithm (1971)It retuns:1) [shortestPaths]: the list of K shortest paths (in cell array 1xK)2) [totalCosts] : costs of the K shortest paths (in array 1xK)Yen's algorithm prevents loops.This function calls a slightly modified/simplified function dijkstra() (submitted by Xiaodong Wang, 2004)The Network/Graph of N nodes is fed in the form of a NXN netCostMatrix which must have positive weights/costs.This file was first submitted on December 9, 2009This update of April 2, 2010 includes the following slight changes:1- Handles exception cases for when no path exists, and now returns an empty matrix (added lines 20 and 29)2- Includes the changes proposed by Darren Rowland

Requirements:	No special requirements
Platforms:	Matlab
Keyword:	20 And,  Added Lines,  Algorithm,  Algorithm Prevents,  And 292,  And Now,  Array,  Array Xkyen,  Based,  Empty,  Includes,  Networkgraph,  Submitted,  Update,  Wang Networkgraph,  Weightscoststhis File,  Which Must Have,  Xiaodong Wang,  Yen Kshortest Path
Users rating:	0/10