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

Algorithm 2

Biased random walk function rw.

	Function()
	Input: network ; start node ; walk length
	Output: node path
(1)	begin
(2)	Initialize ;
(3)	;
(4)	whiledo
(5)	;
(6)	;
(7)	foreachdo
(8)	;
(9)	end
(10)	randomly select a node in with the probabilities in , denoted as ;
(11)	add to ;
(12)	;
(13)	end
(14)	return ;
(15)	end