Re: [Boost-bugs] [Boost C++ Libraries] #11838: contribution: Yen k-shortest paths

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #11838: contribution: Yen k-shortest paths
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2018-07-17 15:55:48

#11838: contribution: Yen k-shortest paths
---------------------------------------+-------------------------------
  Reporter:  Irek Szcześniak <irek@…>  |      Owner:  Jeremiah Willcock
      Type:  Library Submissions       |     Status:  new
 Milestone:  To Be Determined          |  Component:  graph
   Version:  Boost 1.57.0              |   Severity:  Not Applicable
Resolution:                            |   Keywords:
---------------------------------------+-------------------------------

Comment (by andrewmw94):

 Replying to [comment:16 andrewmw94]:
 > I'm interested in getting this added. What still needs to be done?

 More specifically is this just fixing the algorithm or is there extra
 paperwork / API change stuff that I would need to do?

 I think the issue (or at least one issue) with the algorithm is that the
 Kth shortest path is not guaranteed to be a variant of the K-1th shortest
 path. The loop needs to consider all previous shortest paths. So we have
 to do more than just loop through the edges of psp.

-- 
Ticket URL: <https://svn.boost.org/trac10/ticket/11838#comment:17>
Boost C++ Libraries <http://www.boost.org/>
Boost provides free peer-reviewed portable C++ source libraries.