Re: [igraph] getting k-connected nodes from a vertex

[Tamas Nepusz]

>> because when I exam the file content, I find something like:
> 
> C D
> C E
> C F
> B D
> B C
> A C
> A B
That's how graph.neighborhood is supposed to work; it gives you the
first-order neighborhood of the central vertex, so you will find not only
edges that are connected to the central vertex but also edges that go
between the _neighbors_ of the central vertex.

-- 
T.