4 lines (3 loc) · 195 Bytes

C

C-PROG

The Dijsktra's algorithhm is applied in the a case where we have a sequence of computer networks and with every node as a central node, we are trying to find a minimum spanning tree.