A Novel Hierarchical Clustering Approach Based on Universal Gravitation

Algorithm 2

PartGravGraph (G, θ).

	Input: G: the sparse gravitational graph. θ: the threshold of gravitational influence coefficient.
	Output: : the separated gravitational graph.
(1)
(2)	for each vertex v in the graph do
(3)	Search the adjacent vertices of the vertex ;
(4)	for to t do
(5)	Calculate the of the vertex for the vertex by equation (5);
(6)	Calculate the of the vertex for the vertex by equation (5);
(7)	if or then
(8)	Remove the edge from the edge set E of ;
(9)	end
(10)	end
(11)	end
(12)	return ;