[igraph] best path in a undirected graph with weights

[Romildo Martins]

Hi,

Is it possible to choose the best path in a undirected graph with weights?

For example

> g<- graph(c(0,1,1,2,2,0), directed=FALSE)
> E(g)$weights<-c(1,1,5)
> get.shortest.paths(g,0,2)
[[1]]
[1] 0 2

In this case, the best choice is 0,1 -> 1,2

Thanks!