- Thread starter
- #1

- Apr 14, 2013

- 4,951

I am asked to write this problem as a shortest path problem.

What do I have to do?

Do I have to draw a directed weighted graph?

Since the problem is general, do I have to draw the first vertex, the last vertex, and some between them for example the vertex $i$ and $j$,and at the edge from $i$ to $j$ there is a cost $c_{ij}$??