[Boost-bugs] [Boost C++ Libraries] #13205: Suurballe's algorithm for finding two edge disjoint paths in non-negatively weighted graphs would be a great addition to BGL

Subject: [Boost-bugs] [Boost C++ Libraries] #13205: Suurballe's algorithm for finding two edge disjoint paths in non-negatively weighted graphs would be a great addition to BGL
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2017-09-11 11:43:34

#13205: Suurballe's algorithm for finding two edge disjoint paths in non-negatively
weighted graphs would be a great addition to BGL
-------------------------------------------------+-------------------------
 Reporter:  tobiaskussel@…                       |      Owner:  Jeremiah
                                                 |  Willcock
     Type:  Feature Requests                     |     Status:  new
Milestone:  To Be Determined                     |  Component:  graph
  Version:  Boost Release Branch                 |   Severity:  Not
 Keywords:  suurballe, BGL, algorithm, path,     |  Applicable
  disjoint                                       |
-------------------------------------------------+-------------------------
 Suurballe's algorithm is used to find two edge disjoint paths in non-
 negatively weighted graphs. This is a often occuring problem when dealing
 with telecommunication networks, due to resilience constrains.
 The addition to the BGL tookit would be greatly appreciated (even if the
 algorithm is not terribly difficult to implement).

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