Boost :

Date view	Thread view	Subject view	Author view

From: Ruth Brown (Ruth.Brown_at_[hidden])
Date: 2001-06-15 16:29:55

Next message: boost_at_[hidden]: "New file uploaded to boost"
Previous message: Ruth Brown: "[boost] graph transitive closure"
In reply to: David Abrahams: "Re: [boost] matrix and vector iterators"
Next in thread: Vladimir Prus: "Re: [boost] graph algorithm"
Reply: Vladimir Prus: "Re: [boost] graph algorithm"
Reply: Ruth Brown: "[boost]: Hypergraph"

Looking for ideas on how to compute the transitive closure of a graph
that is represented by an adjacency_list graph in BGL.
Has anyone done this?
Thanks,
Ruth
----------------------------------------
Ruth Brown
rbrown_at_[hidden]
336-584-3878

Next message: boost_at_[hidden]: "New file uploaded to boost"
Previous message: Ruth Brown: "[boost] graph transitive closure"
In reply to: David Abrahams: "Re: [boost] matrix and vector iterators"
Next in thread: Vladimir Prus: "Re: [boost] graph algorithm"
Reply: Vladimir Prus: "Re: [boost] graph algorithm"
Reply: Ruth Brown: "[boost]: Hypergraph"

Date view	Thread view	Subject view	Author view

Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk