Re: [Boost-users] [BGL] simple problem: how to detect connections in a dag?

Hi Olaf, Olaf Krzikalla writes:

Hi @boost,

We have a dag and two vertices in this dag. Now we just want to know if these vertices are connected (acrtually we don't need the path),

Some solutions have already been suggested. But: If you want to check more then one pair of vertices, whether they are connected, you could compute the transitive closure of the graph an check for edges in it. Documentation of transitive_closure: http://www.boost.org/doc/libs/1_41_0/libs/graph/doc/transitive_closure.html Yours sincerely, Eric