K-Shortest Path Graph Algorithm

We need David Eppsteins K-Shortest Path Algorithm implemented in C# 2.0. the interface should look like this: Graph g = new Graph(); [login to view URL]("A,B,C,D,E,F"); [login to view URL]("A,B,C", "D,E,F", 1, "alpha"); [login to view URL]("B,C", "D,E", 50, "beta"); // Activating the following line will disable // all alpha-edges // [login to view URL]("alpha") = -1; Path p = [login to view URL]("B", "E"); while ([login to view URL]) { [login to view URL]([login to view URL] + " " + [login to view URL]); p = [login to view URL](); } the algorithm is described below: <[login to view URL]:[login to view URL]~[login to view URL]> ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables): a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment. b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request. 3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement). ## Platform you should use C# 2.0 and the project should be in Visual Studio 2005.