Table 1.

Evaluation of the path-finding methods.

		Method 1 (DFS Algorithm)		Method 2 (Dijkstra Algorithm)		Method 3 (A* Algorithm)		p-Value *	p-Value †	p-Value ‡	No. of Undetected Paths	Total
		No. of Correct Paths	No. of Incorrect Paths	No. of Correct Paths	No. of Incorrect Paths	No. of Correct Paths	No. of Incorrect Paths
AComm		19	25	44	0	36	8	<0.001	<0.001	0.006	16	60
ACA A1	R	51	9	60	0	60	0	0.003	0.003	1	0	60
	L	49	10	59	0	59	0	0.001	0.001	1	1	60
MCA M1	R	55	5	60	0	60	0	0.057	0.057	1	0	60
	L	58	2	60	0	59	1	0.496	1	1	0	60
PComm	R	8	6	14	0	14	0	0.016	0.016	1	46	60
	L	10	8	18	0	18	0	0.003	0.003	1	42	60
PCA P1	R	52	8	57	3	58	2	0.204	0.095	1	0	60
	L	51	9	60	0	60	0	0.003	0.003	1	0	60
PCA P2	R	55	5	60	0	60	0	0.057	0.057	1	0	60
	L	51	9	60	0	60	0	0.003	0.003	1	0	60
BA		53	7	60	0	60	0	0.013	0.013	1	0	60
ICA	R	51	9	50	10	50	10	1	1	1	0	60
	L	51	9	52	8	52	8	1	1	1	0	60
Total		614	121	714	21	706	29				105	840

* Comparison between Method 1 (DFS algorithm) and Method 2 (Dijkstra algorithm). † Comparison between Method 1 (DFS algorithm) and Method 3 (A* algorithm). ‡ Comparison between Method 2 (Dijkstra algorithm) and Method 3 (A* algorithm).