Obtaining a vertex or edge induced subgraph

graph-tool
1

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?

Best regards
Christopher

2

You either use a GraphView, or you build the subgraph by hand while
traversing the graph. I see not other option.

Best,
Tiago

3

I should also point out that building a GraphView with vertex property
map is O(1), so it should be as efficient as you can get.

Best,
Tiago