[R] igraph find the path with the smallest weights

[Wendy]

Hi all, 

I am trying to analyze some graphs in R. Given a weighted directed network
with 7 nodes. I want to find a path from node 1 to node 7, so the sum of all
the edges on the path is the smallest comparing to all the other paths. I am
wondering if I can do this in igraph. After I identify the path, can I
colour code the path?

Thank you in advance.

Wendy


--
View this message in context: http://r.789695.n4.nabble.com/igraph-find-the-path-with-the-smallest-weights-tp4429343p4429343.html
Sent from the R help mailing list archive at Nabble.com.