{"action":"opened","issue":{"url":"https://api.github.com/repos/arnauddri/algorithms/issues/1","labels_url":"https://api.github.com/repos/arnauddri/algorithms/issues/1/labels{/name}","comments_url":"https://api.github.com/repos/arnauddri/algorithms/issues/1/comments","events_url":"https://api.github.com/repos/arnauddri/algorithms/issues/1/events","html_url":"https://github.com/arnauddri/algorithms/issues/1","id":56426843,"number":1,"title":"Yen's K-Shortest Path ","user":{"login":"AlexRevin","id":29443,"avatar_url":"https://avatars.githubusercontent.com/u/29443?v=3","gravatar_id":"","url":"https://api.github.com/users/AlexRevin","html_url":"https://github.com/AlexRevin","followers_url":"https://api.github.com/users/AlexRevin/followers","following_url":"https://api.github.com/users/AlexRevin/following{/other_user}","gists_url":"https://api.github.com/users/AlexRevin/gists{/gist_id}","starred_url":"https://api.github.com/users/AlexRevin/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/AlexRevin/subscriptions","organizations_url":"https://api.github.com/users/AlexRevin/orgs","repos_url":"https://api.github.com/users/AlexRevin/repos","events_url":"https://api.github.com/users/AlexRevin/events{/privacy}","received_events_url":"https://api.github.com/users/AlexRevin/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":0,"created_at":"2015-02-03T19:47:42Z","updated_at":"2015-02-03T19:47:42Z","closed_at":null,"body":"Hello\r\n\r\nI would be thankful a lot if you could add Yen's KSP to the Graphs algorithms. In general, it uses Dijkstra to find k-shortest paths and is crucial, when you need to get multiple weighted shortest paths contrary to one shortest path.\r\n\r\nThere are just a few implementations of it:\r\nhttps://github.com/Pent00/YenKSP in Python\r\nhttps://code.google.com/p/k-shortest-paths/ in C++/Java/C#\r\n\r\nHaving this one implemented would be a radical improvement comparing to other algorithm library implementations.\r\n\r\nOn another hand, I would be very curious to hear about other implementations, like Eppstein or Lawler"}}