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-11-23 11:20:28

#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@…>):

 The reasoning for the used data types:

 * the excluded edges are stored in a set in edksp_filter, to make sure
 that the edge lookup is fast,

 * the path is a list (and not a vector), because the length of the path is
 not known up front (building a path as a vector could resize the vector),
 and the paths are not expected to be heavily used to merit the use of a
 vector,

 * for the same reasons as for a path, the found paths are returned in a
 list, not a vector.

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