Algorithm of minimal spanning tree contain

a$.$ Starting from any node then connecting all nodes one by one in sequence

b$.$ Starting from the edge of minimal distance and then make a sequence of edges in ascending order connecting all nodes

c$.$ Starting from making two sets of connected and unconnected nodes. Then in each step finding an edge of minimal length from connected set to unconnected set

$$ d$.$ Finding minimum number of cycles within the network