Re: [Boost-bugs] [Boost C++ Libraries] #11804: Contribution: edge-disjoint k-shortest paths

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #11804: Contribution: edge-disjoint k-shortest paths
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2015-12-03 08:23:32

#11804: Contribution: edge-disjoint k-shortest paths
  Reporter: Irek SzczeÅ›niak <irek@…> | Owner: jewillco
      Type: Library Submissions | Status: new
 Milestone: To Be Determined | Component: graph
   Version: Boost 1.57.0 | Severity: Not Applicable
Resolution: | Keywords:

Comment (by Irek Szcześniak <irek@…>):

 I attached the third version of the implementation and the unit test.
 This revision has a number of changes:

 * bug fix: the Dijkstra call is using the right property map (wm), and not
 the graph's built in,

 * new feature: the user is allowed to provide an optional argument K,
 which limits the search to at most K shortest paths,

 * performance improvement: the Dijkstra search is stopped as soon as the
 shortest path to the destination vertex is found,

 * added more comments,

 * moved the call to Dijkstra to a separate function, and made the call
 well-formatted (i.e., it's not very long).

Ticket URL: <>
Boost C++ Libraries <>
Boost provides free peer-reviewed portable C++ source libraries.

This archive was generated by hypermail 2.1.7 : 2017-02-16 18:50:19 UTC