I am trying to improve my algorithmic knowledge during the summer break and i found this problem in a book.
We have an undirected graph $G=(V,E$) with starting node $s\in V$ and last node $t \in V$ where weight of every edge $(u,v) \in E$ is a positive number ($w(u,v)>0$).
Actually it asks to prove that finding the shortest path from $s$ to $t$ is equivalent with finding a max flow $f$ from $s$ to $t$.
$f$ minimizes the amount of $Σ_{(u,v)\in E} f(u,v)w(u,v)$ and has the value of $|f|=1$.
It seems that i am missing something. Can anyone help me with this cause i really hate leaving unsolved exercises when reading a book.
Thanks.