Subject: Re: [boost] Boost.Graph Metagraph project
From: caustik (caustik_at_[hidden])
Date: 2011-01-15 23:23:01
This sounds relevant to my interests -- Can these meta-graphs be recursive?
In other words, can a meta-graph contain a subgraph of itself as a node?
Also curious if, and to what extent, the project might support MPI?
On Sat, Jan 15, 2011 at 8:07 PM, Gordon Woodhull <gordon_at_[hidden]>wrote:
> On Jan 15, 2011, at 5:01 PM, Gordon Woodhull wrote:
> > I'm pleased to announce that the proposed MPL.Graph will be included in
> release 1.46 as a sublibrary of MSM! msm::mpl_graph
> Forgot to mention that mpl_graph is being used by MSM to find regions /
> connected components in state machines, and to find unreachable states.
> I think that work may lead me to implement a forest for efficient disjoint
> set tracking. I also want to abstract out the connected components algo -
> Christophe is using DFS directly for now.
> Unsubscribe & other changes:
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk