Boost Users :
Subject: [Boost-users] [BGL] question about connected_components()
From: Andriy Gapon (avg_at_[hidden])
Date: 2012-01-19 16:45:48
says "The connected_components() functions compute the connected components of
an _undirected_ graph using a DFS-based approach." [emphasis mine]
I see somewhat some unexpected things.
o Only the first variant asserts that the graph is undirected, in the second
variant the assert is commented out - why is that?
o Both variants use depth_first_search() and not undirected_dfs(), which would
seem to be more logical for the undirected case - why?
Despite the above questions I actually want to use connected_components() [and
not strong_components()] for a directed graph. Should that be possible? Does
it make sense?
-- Andriy Gapon
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net