Question

Consider the network structure below. Node $1$ is the starting node and node $7$ is the destination. The distances $d_{ij}$ between nodes i and $j$ are given directly on each arc.

$($a$)$ Determine the shortest path from node $1$ to node $7$ using Dijkstra's algorithm.

$($b$)$ Formulate the problem and represent it on a transportation tableau.

$($c$)$ Solve the problem using Hungarian method.