Real-Time Forecast of Influenza Outbreak Using Dynamic Network Marker Based on Minimum Spanning Tree

Algorithm 2

Kruskal.

Input: a weighted undirected graph ;

Output: a minimum spanning tree of this graph.

 1: .

 2: for each vertex do

 3: MAKE-SET

 4: end for

 5: sort the edges of into nondecreasing order by weight

 6: for each edge , taken in nondecreasing order by weight do

 7: ifthen

 8:  

 9:  UNION

10: end if

11: end for

12: return MST