Dynamic routing of packets in a computer network poses a similar problem to the traffic mitigation

problem.

Regularly updated traffic information can be used to provide an estimate of time taken to go from

one suburb to another in a city and plan a journey. Use the given $.$mat file which consists of a cost

matrix with the times to go from one suburb to another at a particular instant in time. The cost

matrix variable name is M and there are $12$ suburbs. Draw the network and find the least cost and

the corresponding path from suburb $1$ to $10.$