id,summary,reporter,owner,description,type,status,milestone,component,version,severity,resolution,keywords,cc
13205,Suurballe's algorithm for finding two edge disjoint paths in non-negatively weighted graphs would be a great addition to BGL,tobiaskussel@…,Jeremiah Willcock,"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).
",Feature Requests,new,To Be Determined,graph,Boost Release Branch,Not Applicable,,"suurballe, BGL, algorithm, path, disjoint",