[igraph] Shortest path with highest weights

[Ragia Ibrahim]

Dear group,
kindly I have a graph that got the following edges:
 6 -> 4 with prob 0.4
 4 -> 3 with prob 0.2

6 -> 7 with prob 0.1
7 -> 3 with prob 0.01

I want to get the shortest path between 6, 3 with the highest probability "prob"
this I wrote this:
max(E(G,path=get.shortest.paths(G,6,3)$vpath[[1]])$prob)

this do not give me the vertices in between, how can I get them? and can I multiply probabilities instead of adding ?

your reply is highly appreciated
thanks in advance
Ragia