RE: [boost] BGL: How do I find ancestors to a node?

From: Jeremy Siek (jsiek_at_[hidden])
Date: 2002-01-15 10:45:01

On Tue, 15 Jan 2002, Asger Alstrup Nielsen wrote:
alstru>
alstru> So, it seems that you do need vector_as_graph after all?

Yes, the transitive_closure algorithm uses vector_as_graph internally. It
should be fairly straightforward to replace the use of std::vector as a
graph with adjacency_list.

Cheers,
Jeremy

----------------------------------------------------------------------
 Jeremy Siek                          http://php.indiana.edu/~jsiek/
 Ph.D. Student, Indiana Univ. B'ton   email: jsiek_at_[hidden]
 C++ Booster (http://www.boost.org)   office phone: [phone]
----------------------------------------------------------------------