[Boost-bugs] [Boost C++ Libraries] #4466: "multiple paths" algorithms

Subject: [Boost-bugs] [Boost C++ Libraries] #4466: "multiple paths" algorithms
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2010-07-25 17:20:17

#4466: "multiple paths" algorithms
 Reporter: anonymous | Owner: asutton
     Type: Feature Requests | Status: new
Milestone: Boost 1.44.0 | Component: graph
  Version: Boost 1.44.0 | Severity: Problem
 Keywords: |
 I'm relatively new to the BGL, so I might be missing something. but it
 seems to me that all algorithms in the BGL deal with finding one specific
 path, or with transforming graphs.

 I recently needed to find all unique paths that connect two nodes, i.e.
 count the number of feedback loops a node is part of in a directed graph,
 and I could not find any algorithm, or visitor that an algorithm could be
 built upon, in BGL.

 a quick google search turned up this for example:

 there might be more algorithms that have multiple paths as a result, I
 don't know, graph theory isn't my specialty. there is at least this one
 and BGL seems to ignore these kinds of algorithms altogether.

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

This archive was generated by hypermail 2.1.7 : 2017-02-16 18:50:03 UTC