Re: [graph-tool] Obtaining a vertex or edge induced subgraph

On 18.09.2015 11:13, Christopher Morris wrote:

Hi,

given a graph G, I want to traverse G in some way, e.g., a random walk of length k, resulting in a set S of vertices or edges. What is the fastest way of retrieving the subgraph of G induced by S.

Is there a better way than using a property map and then GraphView?

You either use a GraphView, or you build the subgraph by hand while traversing the graph. I see not other option. Best, Tiago -- Tiago de Paula Peixoto <tiago@skewed.de>