A Novel Hierarchical Clustering Approach Based on Universal Gravitation

Algorithm 3

MergeGravGraph (G, ).

	Input: G: the original sparse gravitational graph. : the separated gravitational graph.
	Output: : the merged gravitational graph.
(1)	Search out the connected subgraphs in the gravitational graph ;
(2)	Calculate the of the connected subgraphs and by equation (6);
(3)	Select the connected subgraphs and which have the largest ;
(4)	for each vertex v in do
(5)	for each vertex u in do
(6)	if the edge in G then
(7)	Insert the edge into ;
(8)	end
(9)	end
(10)	end
(11)	return ;