Subject: [Boost-users] Subgraph at distance n
From: Rossano Schifanella (schifane_at_[hidden])
Date: 2015-05-02 05:47:58
Hi all,
which is the easiest way to extract from a graph G and a generic node
source a subgraph with all the vertices/edges at distance at most n from
source?
Thanks a lot for your help.
Best,
Rossano