Abstract
This paper tries to find an easy method for solving the problem of routing in computer network where the network is using multigraph. This is done mainly using comparison of weight or cost of various multi arcs between any two nodes. This theory can be implemented in real life to solve Network Routing Problem in Multigraph.
Users
Please
log in to take part in the discussion (add own reviews or comments).