An Information-Theoretic Framework for Evaluating Edge Bundling Visualization

. 2018 Aug 21;20(9):625. doi: 10.3390/e20090625

Algorithm 4Depth-firstSearch( $P : (G L O B A L) i n p u t_p a t h_n u m b e r$ ; $K : i n p u t_c l u s t e r s$ ; $R_{c} : i n p u t_c u r r e n t_r e g i o n$ ; $R_{t} : i n p u t_t a r g e t_r e g i o n$ ), $V I S I T E D [] : i n p u t_s o u r c e_f l a g$ .
1:	P // The number of path between R_s and R_t
2:	VISITED[R_c] ← True
3:	ifR_c = R_t then
4:	P ← P + 1
5:	else
6:	for each adjacent region R_n of R_c do
7:	if VISITED[R_n] = False then Depth-firstSearch(P, K, R_n, R_t, VISITED[R_n])
8:	end if
9:	end for
10:	end if
11:	VISITED[R_c] ← False