An Approach of Community Search with Minimum Spanning Tree Based on Node Embedding

Algorithm 3

CSMST.

	Input: network and its node embedding ; query node ; expected number of returned nodes
	Output: target community
	begin
	initialize ,
	define a variable of map type
	foreach nodedo
	end
	while and do
	find edge such that is minimum
	add to
	foreach node
	do
	ifthen
	del
	end
	else
	end
	end
	end
	return
	end