Re: [igraph] A silly question

[Ish Rattan]

On Tue, 10 Apr 2012, Tam??s Nepusz wrote:

> Use format="ncol"; the NCOL format is similar to the edge list format but
> it also supports weights.

I had success with:
 g <- read.graph("file", format="ncol", direted=TRUE, weight=TRUE)

Now for this graph g,

  l <- get.shortest.paths(g, 0, to=V(g), mode=c("out"))

I get one list of vertices on the path for each target vertex,
is there a way find the cost of path too (sum of the edge weights in
the path)?

-ishwar