Boost logo

Boost :

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

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.


Boost list run by bdawes at, gregod at, cpdaniel at, john at