Opened 5 years ago
#13205 new Feature Requests
Suurballe's algorithm for finding two edge disjoint paths in non-negatively weighted graphs would be a great addition to BGL
| Reported by: | Owned by: | Jeremiah Willcock | |
|---|---|---|---|
| Milestone: | To Be Determined | Component: | graph |
| Version: | Boost Release Branch | Severity: | Not Applicable |
| Keywords: | suurballe, BGL, algorithm, path, disjoint | Cc: |
Description
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).
Note:
See TracTickets
for help on using tickets.
