Opened 12 years ago

Last modified 12 years ago

#4466 new Feature Requests

"multiple paths" algorithms

Reported by: anonymous Owned by: Andrew Sutton
Milestone: To Be Determined Component: graph
Version: Boost 1.44.0 Severity: Problem
Keywords: Cc:

Description

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: http://portal.acm.org/citation.cfm?id=7863

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.

Change History (1)

comment:1 by Jeremiah Willcock, 12 years ago

Milestone: Boost 1.44.0To Be Determined
Note: See TracTickets for help on using tickets.