The following Matlab project contains the source code and Matlab examples used for k shortest paths in a graph represented by a sparse matrix (yen's algorithm).
[ DIST, PATH ] = graphkshortestpaths( G, S, T, K ) determines the K shortest paths from node S to node T.

The source code and files included in this project are listed in the project files section, please make sure whether the listed source code meet your needs there.

## Project Files:

File Name | Size |
---|---|

graphkshortestpaths.m | 3022 |

license.txt | 1316 |