Find the shortest path between two given nodes using positive edge weights

156 Views Asked by At

I would like to obtain the shortest path between the nodes $v'$ and $v''$ using positive edge weights in the graph investigated. More precisely, I don't need for the shortest path between $u'$ and $u''$ if $\{u',u''\} \ne \{v',v''\}$. Is there any effective algorithm for this problem?