Hi David, I'm not sure if this is the fastest way, but perhaps you could try the subcomponent function. Namely, the out-component of a vertex in a DAG will comprise that vertex and all direct plus indirect descendants of that vertex.
Dov On Wed, Jan 9, 2013 at 7:17 AM, David Edwards <[email protected]>wrote: > Dear all**** > > ** ** > > Given a directed acyclic graph with a numeric vertex attribute, I would > like to calculate the sum of the attributes over all descendents of a given > vertex. Any suggestions for an efficient way to do this? The graph may be > quite large.**** > > ** ** > > David**** > > ** ** > > ** ** > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help > >
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
