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

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