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: 2016-03-14 21:29:25

#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 added a simplified implementation and a modified unit test.  This
 implementation does not use the exclude_filter.hpp, which I implemented.
 Instead, we use the filter provided by the filtered_graph.

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