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

[Tamas Nepusz]

> HOWEVER, IT IS A LIST OF GRAPHS AND THE NAMES OF THE VERTICES MAY HAVE LOST?
No, they are not lost:

> g <- graph.famous("petersen")
> V(g)$name <- LETTERS[1:10]
> graph.list <- graph.neighborhood(g, 1, "A")
> g2 <- graph.list[[1]]
> V(g2)$name
[1] "A" "B" "E" "F"

> write.graph(g, "edgelist.txt",format="edgelist") so I will obtain some
> resultant files like:
The "edgelist" format uses the numeric vertex IDs, not the names. Use the
"ncol" format instead if you want to print the names.

-- 
T.