[graph-tool] Get all the dependant nodes or a root node in a new sub-graph

Nasgar josubg at gmail.com
Mon Jul 9 12:03:36 CEST 2012


Thanks!



On Wed, Jul 4, 2012 at 2:09 PM, Tiago de Paula Peixoto <tiago at skewed.de>wrote:

> On 07/04/2012 01:59 PM, josubg wrote:
> > Hi everybody,
> >
> > I have a graph that contains all the word of a text. This graph is a a
> > directed acyclic graph.
> >
> > I want to reconstruct sequences of this text so I need to get all the
> nodes
> > and edges that are dependent of a root node or their children. In other
> > words I want a Sub-tree of a tree.
> >
> > I cant get it with a recursive ad-hoc function, using out_neighbours(),
> but
> > I am wondering if there is another more efficient way to obtain it. I
> > searched in the doc but i don't find it.
>
> You want the label_out_component() function:
>
>
> http://projects.skewed.de/graph-tool/doc/topology.html#graph_tool.topology.label_out_component
>
> Cheers,
> Tiago
>
> --
> Tiago de Paula Peixoto <tiago at skewed.de>
>
>
>
>
> _______________________________________________
> graph-tool mailing list
> graph-tool at skewed.de
> http://lists.skewed.de/mailman/listinfo/graph-tool
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://lists.skewed.de/pipermail/graph-tool/attachments/20120709/57272104/attachment.htm>


More information about the graph-tool mailing list