From: Nicolas G. <nic...@gm...> - 2007-03-29 09:33:04
Hi,
Here's my problem:
I would like to extract a subgraph (or a list of vertices) comprised
of all vertices within a distance N from a given vertex.
Is it directly possible?
Or do I have to call neighborListOf(Graph<V,E> g, V vertex) N times?
Thanks.
Nicolas
Hi,
Here's my problem:
I would like to extract a subgraph (or a list of vertices) comprised
of all vertices within a distance N from a given vertex.
Is it directly possible?
Or do I have to call neighborListOf(Graph<V,E> g, V vertex) N times?
Thanks.
Nicolas