GitHub - arnaudgelas/KShortestPaths

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 16 Commits
data		data
.gitignore		.gitignore
BaseGraph.cpp		BaseGraph.cpp
BaseGraph.h		BaseGraph.h
BasePath.cpp		BasePath.cpp
BasePath.h		BasePath.h
CMakeLists.txt		CMakeLists.txt
DijkstraShortestPathAlg.cpp		DijkstraShortestPathAlg.cpp
DijkstraShortestPathAlg.h		DijkstraShortestPathAlg.h
DynamicGraph.cpp		DynamicGraph.cpp
DynamicGraph.h		DynamicGraph.h
Graph.cpp		Graph.cpp
Graph.h		Graph.h
GraphElements.h		GraphElements.h
HeaderTest.cpp		HeaderTest.cpp
MainP.cpp		MainP.cpp
ReadMe.txt		ReadMe.txt
TGraph.cpp		TGraph.cpp
TGraph.h		TGraph.h
TPath.cpp		TPath.cpp
TPath.h		TPath.h
YenTopKShortestPathsAlg.cpp		YenTopKShortestPathsAlg.cpp
YenTopKShortestPathsAlg.h		YenTopKShortestPathsAlg.h

Repository files navigation

The package contains the implementation of Yen's algorithm for top-k shortest paths in a directed weighted graph. 

Note that:
1. It's implemented in CPP. (The version is 2)
2. The source code is compiled under visual studio 2008 c/c++ compiler. 
3. Compared with previous versions, version 2 does not require Boost library any longer.
4. Main() function explains how to use the implentation.