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

Subject: [Boost-bugs] [Boost C++ Libraries] #11804: Contribution: edge-disjoint k-shortest paths
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2015-11-18 22:04:36

#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
 Keywords: |

 I want to contribute a function that calculates edge-disjoint k-shortest

 The algorithm searches for a shortest path. Then it disables the edges of
 the shortest path, and repeats the search. On so on, until no path can be

 I'm attaching the source file and a unit test.

 There are two things that bug me in the code:

 * the predecessor map is hardcoded as:

   boost::vector_property_map<edge_descriptor> pred(num_vertices(g));

   while perhaps it should depend on the graph type,

 * the formatting of this call is ugly:

     (fg, s,

 I would appreciate it, if someone could give me a hint on these two

 I would also appreciate very much any comments and improvements.


Ticket URL: <https://svn.boost.org/trac/boost/ticket/11804>
Boost C++ Libraries <http://www.boost.org/>
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