I have to formulate the well known shortest path problem as a min-cost flow problem, but I don't know how to do it.
I need your help and suggestions.
Thanks in advance!
I found an article on wikipedia where it explains how to reduce the minimum cost flow to a Shortest Path Problem: https://en.wikipedia.org/wiki/Minimum-cost_flow_problem :
The solution is to remove the capacity constraint.