Abstract
T
he article presents a simple algorithm to construct
minimum spanning tree
and
to find shortest path between pair of vertices in a graph. Our illustration includes the proof
of termination. The complexity analysis an
d simulation results have also been included.
Users
Please
log in to take part in the discussion (add own reviews or comments).