[Boost-users] Subgraph at distance n

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