[Trilinos-Users] tree/co-tree identification

[Erik Boman]

Hi Davood,

I'm not sure if anybody replied to this already. I think what you need
is to compute a spanning tree of a graph. Such graph algorithms are
currently not supported in Trilinos, so you should look at libraries
targeted to graphs, like BOOST. (There is also a parallel BOOST, see
http://www.osl.iu.edu/research/pbgl .) In general, there are many
spanning trees for a graph so you may want a minimum or maximum weight
spanning tree, depending on your objective.

Regards,
Erik

On Mon, 2008-04-07 at 06:17 -0600, Davood Ansari wrote:
> Hi every one
> 
> I am not sure if this makes sound to any one down here.
> In FEM analysis, it happens very often that we need to split the
> graph 
> (the FE mesh is a graph) into two parts: the tree and the co-tree.
> 
> (the tree is any connected set of graph edges that meet all nodes and
> do not make any closed loops).
> 
> I wonder if there are any ready made functions for the identification
> of the tree and/or 
> the co-tree. If not, still may some of you be aware of any other
> substitute for that purpose ?
> 
> Yours
> Davood
>