Boost :

Date view	Thread view	Subject view	Author view

From: Vladimir Prus (ghost_at_[hidden])
Date: 2001-06-18 05:39:15

Next message: Vladimir Prus: "Re: Experiment in Automata syntax"
Previous message: Paul Baxter: "Formal review notifications"
In reply to: Ruth Brown: "[boost] graph algorithm"
Next in thread: Jeremy Siek: "Re: [boost] graph algorithm"
Reply: Jeremy Siek: "Re: [boost] graph algorithm"

On Saturday 16 June 2001 01:29, Ruth Brown wrote:
> Looking for ideas on how to compute the transitive closure of a graph
> that is represented by an adjacency_list graph in BGL.

I'm surprised to not find transitive closure in BGL. Some time ago I have
converted transitive closure algorithm present in LEDA to GTL. It seems like
it will work with adjacency_list. If there's interest, I can adapt the
algorithm for BGL.

-- 
Regards,
Vladimir

Next message: Vladimir Prus: "Re: Experiment in Automata syntax"
Previous message: Paul Baxter: "Formal review notifications"
In reply to: Ruth Brown: "[boost] graph algorithm"
Next in thread: Jeremy Siek: "Re: [boost] graph algorithm"
Reply: Jeremy Siek: "Re: [boost] graph algorithm"

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