https://svn.boost.org/trac10/ticket/4466 <p> 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. </p> <p> 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. </p> <p> a quick google search turned up this for example: <a class="ext-link" href="http://portal.acm.org/citation.cfm?id=7863"><span class="icon">​</span>http://portal.acm.org/citation.cfm?id=7863</a> </p> <p> 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. </p> en-us /htdocs/site/boost.png https://svn.boost.org/trac10/ticket/4466 Trac 1.4.3 Jeremiah Willcock Wed, 08 Dec 2010 19:45:07 GMT https://svn.boost.org/trac10/ticket/4466#comment:1 https://svn.boost.org/trac10/ticket/4466#comment:1 <ul> <li><strong>milestone</strong> <span class="trac-field-old">Boost 1.44.0</span> → <span class="trac-field-new">To Be Determined</span> </li> </ul> Ticket