id	sid	tid	token	lemma	pos
bjmsr-366	1	1	copyright	copyright	NOUN
bjmsr-366	1	2	©	©	PROPN
bjmsr-366	1	3	cc	cc	PROPN
bjmsr-366	1	4	-	-	PUNCT
bjmsr-366	1	5	by	by	ADP
bjmsr-366	1	6	-	-	PUNCT
bjmsr-366	1	7	nc	nc	PROPN
bjmsr-366	1	8	2019	2019	NUM
bjmsr-366	1	9	,	,	PUNCT
bjmsr-366	1	10	bjmsr	bjmsr	PROPN
bjmsr-366	1	11	bangladesh	bangladesh	PROPN
bjmsr-366	1	12	journal	journal	PROPN
bjmsr-366	1	13	of	of	ADP
bjmsr-366	1	14	multidisciplinary	multidisciplinary	ADJ
bjmsr-366	1	15	scientific	scientific	ADJ
bjmsr-366	1	16	research	research	NOUN
bjmsr-366	1	17	;	;	PUNCT
bjmsr-366	1	18	vol	vol	NOUN
bjmsr-366	1	19	.	.	NOUN
bjmsr-366	1	20	1	1	NUM
bjmsr-366	1	21	,	,	PUNCT
bjmsr-366	1	22	no	no	INTJ
bjmsr-366	1	23	.	.	NOUN
bjmsr-366	1	24	2	2	NUM
bjmsr-366	1	25	issn	issn	PROPN
bjmsr-366	1	26	2687	2687	NUM
bjmsr-366	1	27	-	-	PUNCT
bjmsr-366	1	28	850x	850x	NUM
bjmsr-366	1	29	e	e	NOUN
bjmsr-366	1	30	-	-	PROPN
bjmsr-366	1	31	issn	issn	PROPN
bjmsr-366	1	32	2687	2687	NUM
bjmsr-366	1	33	-	-	SYM
bjmsr-366	1	34	8518	8518	NUM
bjmsr-366	1	35	july	july	PROPN
bjmsr-366	1	36	-	-	PUNCT
bjmsr-366	1	37	september	september	PROPN
bjmsr-366	1	38	;	;	PUNCT
bjmsr-366	1	39	2019	2019	NUM
bjmsr-366	1	40	published	publish	VERB
bjmsr-366	1	41	by	by	ADP
bjmsr-366	1	42	centre	centre	NOUN
bjmsr-366	1	43	for	for	ADP
bjmsr-366	1	44	research	research	NOUN
bjmsr-366	1	45	on	on	ADP
bjmsr-366	1	46	islamic	islamic	ADJ
bjmsr-366	1	47	banking	banking	PROPN
bjmsr-366	1	48	&	&	CCONJ
bjmsr-366	1	49	finance	finance	PROPN
bjmsr-366	1	50	and	and	CCONJ
bjmsr-366	1	51	business	business	NOUN
bjmsr-366	1	52	41	41	NUM
bjmsr-366	1	53	finding	find	VERB
bjmsr-366	1	54	shortest	short	ADJ
bjmsr-366	1	55	path	path	NOUN
bjmsr-366	1	56	for	for	ADP
bjmsr-366	1	57	road	road	NOUN
bjmsr-366	1	58	network	network	NOUN
bjmsr-366	1	59	using	use	VERB
bjmsr-366	1	60	dijkstra	dijkstra	PROPN
bjmsr-366	1	61	’s	’s	PART
bjmsr-366	1	62	algorithm	algorithm	PROPN
bjmsr-366	1	63	md	md	PROPN
bjmsr-366	1	64	.	.	PROPN
bjmsr-366	1	65	almash	almash	PROPN
bjmsr-366	1	66	alam	alam	PROPN
bjmsr-366	1	67	lecturer	lecturer	PROPN
bjmsr-366	1	68	department	department	PROPN
bjmsr-366	1	69	of	of	ADP
bjmsr-366	1	70	computer	computer	NOUN
bjmsr-366	1	71	science	science	NOUN
bjmsr-366	1	72	and	and	CCONJ
bjmsr-366	1	73	engineering	engineering	NOUN
bjmsr-366	1	74	bangladesh	bangladesh	PROPN
bjmsr-366	1	75	army	army	PROPN
bjmsr-366	1	76	university	university	PROPN
bjmsr-366	1	77	of	of	ADP
bjmsr-366	1	78	engineering	engineering	PROPN
bjmsr-366	1	79	&	&	CCONJ
bjmsr-366	1	80	technology	technology	PROPN
bjmsr-366	1	81	,	,	PUNCT
bjmsr-366	1	82	natore	natore	NOUN
bjmsr-366	1	83	,	,	PUNCT
bjmsr-366	1	84	bangladesh	bangladesh	NOUN
bjmsr-366	1	85	e	e	NOUN
bjmsr-366	1	86	-	-	NOUN
bjmsr-366	1	87	mail	mail	NOUN
bjmsr-366	1	88	:	:	PUNCT
bjmsr-366	1	89	almash.anik.61@gmail.com	almash.anik.61@gmail.com	PROPN
bjmsr-366	1	90	md	md	PROPN
bjmsr-366	1	91	.	.	PUNCT
bjmsr-366	2	1	omar	omar	PROPN
bjmsr-366	2	2	faruq	faruq	PROPN
bjmsr-366	2	3	lecturer	lecturer	PROPN
bjmsr-366	2	4	department	department	PROPN
bjmsr-366	2	5	of	of	ADP
bjmsr-366	2	6	computer	computer	NOUN
bjmsr-366	2	7	science	science	NOUN
bjmsr-366	2	8	and	and	CCONJ
bjmsr-366	2	9	engineering	engineering	NOUN
bjmsr-366	2	10	bangladesh	bangladesh	PROPN
bjmsr-366	2	11	army	army	PROPN
bjmsr-366	2	12	university	university	PROPN
bjmsr-366	2	13	of	of	ADP
bjmsr-366	2	14	engineering	engineering	PROPN
bjmsr-366	2	15	&	&	CCONJ
bjmsr-366	2	16	technology	technology	PROPN
bjmsr-366	2	17	,	,	PUNCT
bjmsr-366	2	18	natore	natore	NOUN
bjmsr-366	2	19	,	,	PUNCT
bjmsr-366	2	20	bangladesh	bangladesh	NOUN
bjmsr-366	2	21	e	e	NOUN
bjmsr-366	2	22	-	-	NOUN
bjmsr-366	2	23	mail	mail	NOUN
bjmsr-366	3	1	:	:	PUNCT
bjmsr-366	3	2	omarfarukcse10@gmail.com	omarfarukcse10@gmail.com	NUM
bjmsr-366	3	3	abstract	abstract	ADJ
bjmsr-366	3	4	roads	road	NOUN
bjmsr-366	3	5	play	play	VERB
bjmsr-366	3	6	a	a	DET
bjmsr-366	3	7	major	major	ADJ
bjmsr-366	3	8	role	role	NOUN
bjmsr-366	3	9	to	to	ADP
bjmsr-366	3	10	the	the	DET
bjmsr-366	3	11	people	people	NOUN
bjmsr-366	3	12	live	live	VERB
bjmsr-366	3	13	in	in	ADP
bjmsr-366	3	14	various	various	ADJ
bjmsr-366	3	15	states	state	NOUN
bjmsr-366	3	16	,	,	PUNCT
bjmsr-366	3	17	cities	city	NOUN
bjmsr-366	3	18	,	,	PUNCT
bjmsr-366	3	19	town	town	NOUN
bjmsr-366	3	20	and	and	CCONJ
bjmsr-366	3	21	villages	village	NOUN
bjmsr-366	3	22	,	,	PUNCT
bjmsr-366	3	23	from	from	ADP
bjmsr-366	3	24	each	each	DET
bjmsr-366	3	25	and	and	CCONJ
bjmsr-366	3	26	every	every	DET
bjmsr-366	3	27	day	day	NOUN
bjmsr-366	3	28	they	they	PRON
bjmsr-366	3	29	travel	travel	VERB
bjmsr-366	3	30	to	to	ADP
bjmsr-366	3	31	work	work	NOUN
bjmsr-366	3	32	,	,	PUNCT
bjmsr-366	3	33	to	to	ADP
bjmsr-366	3	34	schools	school	NOUN
bjmsr-366	3	35	,	,	PUNCT
bjmsr-366	3	36	to	to	ADP
bjmsr-366	3	37	business	business	NOUN
bjmsr-366	3	38	meetings	meeting	NOUN
bjmsr-366	3	39	,	,	PUNCT
bjmsr-366	3	40	and	and	CCONJ
bjmsr-366	3	41	to	to	PART
bjmsr-366	3	42	transport	transport	VERB
bjmsr-366	3	43	their	their	PRON
bjmsr-366	3	44	goods	good	NOUN
bjmsr-366	3	45	.	.	PUNCT
bjmsr-366	4	1	even	even	ADV
bjmsr-366	4	2	in	in	ADP
bjmsr-366	4	3	this	this	DET
bjmsr-366	4	4	modern	modern	ADJ
bjmsr-366	4	5	era	era	NOUN
bjmsr-366	4	6	whole	whole	ADJ
bjmsr-366	4	7	world	world	NOUN
bjmsr-366	4	8	used	use	VERB
bjmsr-366	4	9	roads	road	NOUN
bjmsr-366	4	10	,	,	PUNCT
bjmsr-366	4	11	remain	remain	VERB
bjmsr-366	4	12	one	one	NUM
bjmsr-366	4	13	of	of	ADP
bjmsr-366	4	14	the	the	DET
bjmsr-366	4	15	most	most	ADV
bjmsr-366	4	16	useful	useful	ADJ
bjmsr-366	4	17	mediums	medium	NOUN
bjmsr-366	4	18	used	use	VERB
bjmsr-366	4	19	most	most	ADV
bjmsr-366	4	20	frequently	frequently	ADV
bjmsr-366	4	21	for	for	ADP
bjmsr-366	4	22	transportation	transportation	NOUN
bjmsr-366	4	23	and	and	CCONJ
bjmsr-366	4	24	travel	travel	NOUN
bjmsr-366	4	25	.	.	PUNCT
bjmsr-366	5	1	the	the	DET
bjmsr-366	5	2	manipulation	manipulation	NOUN
bjmsr-366	5	3	of	of	ADP
bjmsr-366	5	4	shortest	short	ADJ
bjmsr-366	5	5	paths	path	NOUN
bjmsr-366	5	6	between	between	ADP
bjmsr-366	5	7	various	various	ADJ
bjmsr-366	5	8	locations	location	NOUN
bjmsr-366	5	9	appears	appear	VERB
bjmsr-366	5	10	to	to	PART
bjmsr-366	5	11	be	be	AUX
bjmsr-366	5	12	a	a	DET
bjmsr-366	5	13	major	major	ADJ
bjmsr-366	5	14	problem	problem	NOUN
bjmsr-366	5	15	in	in	ADP
bjmsr-366	5	16	the	the	DET
bjmsr-366	5	17	road	road	NOUN
bjmsr-366	5	18	networks	network	NOUN
bjmsr-366	5	19	.	.	PUNCT
bjmsr-366	6	1	the	the	DET
bjmsr-366	6	2	large	large	ADJ
bjmsr-366	6	3	range	range	NOUN
bjmsr-366	6	4	of	of	ADP
bjmsr-366	6	5	applications	application	NOUN
bjmsr-366	6	6	and	and	CCONJ
bjmsr-366	6	7	product	product	NOUN
bjmsr-366	6	8	was	be	AUX
bjmsr-366	6	9	introduced	introduce	VERB
bjmsr-366	6	10	to	to	PART
bjmsr-366	6	11	solve	solve	VERB
bjmsr-366	6	12	or	or	CCONJ
bjmsr-366	6	13	overcome	overcome	VERB
bjmsr-366	6	14	the	the	DET
bjmsr-366	6	15	difficulties	difficulty	NOUN
bjmsr-366	6	16	by	by	ADP
bjmsr-366	6	17	developing	develop	VERB
bjmsr-366	6	18	different	different	ADJ
bjmsr-366	6	19	shortest	short	ADJ
bjmsr-366	6	20	path	path	NOUN
bjmsr-366	6	21	algorithms	algorithm	NOUN
bjmsr-366	6	22	.	.	PUNCT
bjmsr-366	7	1	even	even	ADV
bjmsr-366	7	2	now	now	ADV
bjmsr-366	7	3	the	the	DET
bjmsr-366	7	4	problem	problem	NOUN
bjmsr-366	7	5	still	still	ADV
bjmsr-366	7	6	exists	exist	VERB
bjmsr-366	7	7	to	to	PART
bjmsr-366	7	8	find	find	VERB
bjmsr-366	7	9	the	the	DET
bjmsr-366	7	10	shortest	short	ADJ
bjmsr-366	7	11	path	path	NOUN
bjmsr-366	7	12	for	for	ADP
bjmsr-366	7	13	road	road	NOUN
bjmsr-366	7	14	networks	network	NOUN
bjmsr-366	7	15	.	.	PUNCT
bjmsr-366	8	1	shortest	short	ADJ
bjmsr-366	8	2	path	path	NOUN
bjmsr-366	8	3	problems	problem	NOUN
bjmsr-366	8	4	are	be	AUX
bjmsr-366	8	5	inevitable	inevitable	ADJ
bjmsr-366	8	6	in	in	ADP
bjmsr-366	8	7	road	road	NOUN
bjmsr-366	8	8	network	network	NOUN
bjmsr-366	8	9	applications	application	NOUN
bjmsr-366	8	10	such	such	ADJ
bjmsr-366	8	11	as	as	ADP
bjmsr-366	8	12	city	city	NOUN
bjmsr-366	8	13	emergency	emergency	NOUN
bjmsr-366	8	14	handling	handling	NOUN
bjmsr-366	8	15	and	and	CCONJ
bjmsr-366	8	16	drive	drive	VERB
bjmsr-366	8	17	guiding	guiding	NOUN
bjmsr-366	8	18	system	system	NOUN
bjmsr-366	8	19	.	.	PUNCT
bjmsr-366	9	1	basic	basic	ADJ
bjmsr-366	9	2	concepts	concept	NOUN
bjmsr-366	9	3	of	of	ADP
bjmsr-366	9	4	network	network	NOUN
bjmsr-366	9	5	analysis	analysis	NOUN
bjmsr-366	9	6	in	in	ADP
bjmsr-366	9	7	connection	connection	NOUN
bjmsr-366	9	8	with	with	ADP
bjmsr-366	9	9	traffic	traffic	NOUN
bjmsr-366	9	10	issues	issue	NOUN
bjmsr-366	9	11	are	be	AUX
bjmsr-366	9	12	explored	explore	VERB
bjmsr-366	9	13	.	.	PUNCT
bjmsr-366	10	1	the	the	DET
bjmsr-366	10	2	traffic	traffic	NOUN
bjmsr-366	10	3	condition	condition	NOUN
bjmsr-366	10	4	among	among	ADP
bjmsr-366	10	5	a	a	DET
bjmsr-366	10	6	city	city	NOUN
bjmsr-366	10	7	changes	change	NOUN
bjmsr-366	10	8	from	from	ADP
bjmsr-366	10	9	time	time	NOUN
bjmsr-366	10	10	to	to	ADP
bjmsr-366	10	11	time	time	NOUN
bjmsr-366	10	12	and	and	CCONJ
bjmsr-366	10	13	there	there	PRON
bjmsr-366	10	14	are	be	VERB
bjmsr-366	10	15	usually	usually	ADV
bjmsr-366	10	16	huge	huge	ADJ
bjmsr-366	10	17	amounts	amount	NOUN
bjmsr-366	10	18	of	of	ADP
bjmsr-366	10	19	requests	request	NOUN
bjmsr-366	10	20	occur	occur	VERB
bjmsr-366	10	21	,	,	PUNCT
bjmsr-366	10	22	it	it	PRON
bjmsr-366	10	23	needs	need	VERB
bjmsr-366	10	24	to	to	PART
bjmsr-366	10	25	find	find	VERB
bjmsr-366	10	26	the	the	DET
bjmsr-366	10	27	solution	solution	NOUN
bjmsr-366	10	28	quickly	quickly	ADV
bjmsr-366	10	29	.	.	PUNCT
bjmsr-366	11	1	the	the	DET
bjmsr-366	11	2	above	above	ADJ
bjmsr-366	11	3	problems	problem	NOUN
bjmsr-366	11	4	can	can	AUX
bjmsr-366	11	5	be	be	AUX
bjmsr-366	11	6	rectified	rectify	VERB
bjmsr-366	11	7	through	through	ADP
bjmsr-366	11	8	shortest	short	ADJ
bjmsr-366	11	9	paths	path	NOUN
bjmsr-366	11	10	by	by	ADP
bjmsr-366	11	11	using	use	VERB
bjmsr-366	11	12	the	the	DET
bjmsr-366	11	13	dijkstra	dijkstra	PROPN
bjmsr-366	11	14	’s	’s	PART
bjmsr-366	11	15	algorithm	algorithm	NOUN
bjmsr-366	11	16	.	.	PUNCT
bjmsr-366	12	1	the	the	DET
bjmsr-366	12	2	main	main	ADJ
bjmsr-366	12	3	objective	objective	NOUN
bjmsr-366	12	4	is	be	AUX
bjmsr-366	12	5	the	the	DET
bjmsr-366	12	6	low	low	ADJ
bjmsr-366	12	7	cost	cost	NOUN
bjmsr-366	12	8	of	of	ADP
bjmsr-366	12	9	the	the	DET
bjmsr-366	12	10	implementation	implementation	NOUN
bjmsr-366	12	11	.	.	PUNCT
bjmsr-366	13	1	the	the	DET
bjmsr-366	13	2	shortest	short	ADJ
bjmsr-366	13	3	path	path	NOUN
bjmsr-366	13	4	problem	problem	NOUN
bjmsr-366	13	5	is	be	AUX
bjmsr-366	13	6	to	to	PART
bjmsr-366	13	7	find	find	VERB
bjmsr-366	13	8	a	a	DET
bjmsr-366	13	9	path	path	NOUN
bjmsr-366	13	10	between	between	ADP
bjmsr-366	13	11	two	two	NUM
bjmsr-366	13	12	vertices	vertex	NOUN
bjmsr-366	13	13	(	(	PUNCT
bjmsr-366	13	14	nodes	node	NOUN
bjmsr-366	13	15	)	)	PUNCT
bjmsr-366	13	16	on	on	ADP
bjmsr-366	13	17	a	a	DET
bjmsr-366	13	18	given	give	VERB
bjmsr-366	13	19	graph	graph	NOUN
bjmsr-366	13	20	,	,	PUNCT
bjmsr-366	13	21	such	such	ADJ
bjmsr-366	13	22	that	that	SCONJ
bjmsr-366	13	23	the	the	DET
bjmsr-366	13	24	sum	sum	NOUN
bjmsr-366	13	25	of	of	ADP
bjmsr-366	13	26	the	the	DET
bjmsr-366	13	27	weights	weight	NOUN
bjmsr-366	13	28	on	on	ADP
bjmsr-366	13	29	its	its	PRON
bjmsr-366	13	30	constituent	constituent	NOUN
bjmsr-366	13	31	edges	edge	NOUN
bjmsr-366	13	32	is	be	AUX
bjmsr-366	13	33	minimized	minimize	VERB
bjmsr-366	13	34	.	.	PUNCT
bjmsr-366	14	1	this	this	DET
bjmsr-366	14	2	problem	problem	NOUN
bjmsr-366	14	3	has	have	AUX
bjmsr-366	14	4	been	be	AUX
bjmsr-366	14	5	intensively	intensively	ADV
bjmsr-366	14	6	investigated	investigate	VERB
bjmsr-366	14	7	over	over	ADP
bjmsr-366	14	8	years	year	NOUN
bjmsr-366	14	9	,	,	PUNCT
bjmsr-366	14	10	due	due	ADP
bjmsr-366	14	11	to	to	ADP
bjmsr-366	14	12	its	its	PRON
bjmsr-366	14	13	extensive	extensive	ADJ
bjmsr-366	14	14	applications	application	NOUN
bjmsr-366	14	15	in	in	ADP
bjmsr-366	14	16	graph	graph	NOUN
bjmsr-366	14	17	theory	theory	NOUN
bjmsr-366	14	18	,	,	PUNCT
bjmsr-366	14	19	artificial	artificial	ADJ
bjmsr-366	14	20	intelligence	intelligence	NOUN
bjmsr-366	14	21	,	,	PUNCT
bjmsr-366	14	22	computer	computer	NOUN
bjmsr-366	14	23	network	network	NOUN
bjmsr-366	14	24	and	and	CCONJ
bjmsr-366	14	25	the	the	DET
bjmsr-366	14	26	design	design	NOUN
bjmsr-366	14	27	of	of	ADP
bjmsr-366	14	28	transportation	transportation	NOUN
bjmsr-366	14	29	systems	system	NOUN
bjmsr-366	14	30	.	.	PUNCT
bjmsr-366	15	1	the	the	DET
bjmsr-366	15	2	classic	classic	ADJ
bjmsr-366	15	3	dijkstra	dijkstra	PROPN
bjmsr-366	15	4	’s	’s	PART
bjmsr-366	15	5	algorithm	algorithm	NOUN
bjmsr-366	15	6	was	be	AUX
bjmsr-366	15	7	designed	design	VERB
bjmsr-366	15	8	to	to	PART
bjmsr-366	15	9	solve	solve	VERB
bjmsr-366	15	10	the	the	DET
bjmsr-366	15	11	single	single	ADJ
bjmsr-366	15	12	source	source	NOUN
bjmsr-366	15	13	shortest	short	ADJ
bjmsr-366	15	14	path	path	NOUN
bjmsr-366	15	15	problem	problem	NOUN
bjmsr-366	15	16	for	for	ADP
bjmsr-366	15	17	a	a	DET
bjmsr-366	15	18	static	static	ADJ
bjmsr-366	15	19	graph	graph	NOUN
bjmsr-366	15	20	.	.	PUNCT
bjmsr-366	16	1	it	it	PRON
bjmsr-366	16	2	works	work	VERB
bjmsr-366	16	3	starting	start	VERB
bjmsr-366	16	4	from	from	ADP
bjmsr-366	16	5	the	the	DET
bjmsr-366	16	6	source	source	NOUN
bjmsr-366	16	7	node	node	NOUN
bjmsr-366	16	8	and	and	CCONJ
bjmsr-366	16	9	calculating	calculate	VERB
bjmsr-366	16	10	the	the	DET
bjmsr-366	16	11	shortest	short	ADJ
bjmsr-366	16	12	path	path	NOUN
bjmsr-366	16	13	on	on	ADP
bjmsr-366	16	14	the	the	DET
bjmsr-366	16	15	whole	whole	ADJ
bjmsr-366	16	16	network	network	NOUN
bjmsr-366	16	17	.	.	PUNCT
bjmsr-366	17	1	noting	note	VERB
bjmsr-366	17	2	that	that	SCONJ
bjmsr-366	17	3	an	an	DET
bjmsr-366	17	4	upper	upper	ADJ
bjmsr-366	17	5	bound	bound	NOUN
bjmsr-366	17	6	of	of	ADP
bjmsr-366	17	7	the	the	DET
bjmsr-366	17	8	distance	distance	NOUN
bjmsr-366	17	9	between	between	ADP
bjmsr-366	17	10	two	two	NUM
bjmsr-366	17	11	nodes	node	NOUN
bjmsr-366	17	12	can	can	AUX
bjmsr-366	17	13	be	be	AUX
bjmsr-366	17	14	evaluated	evaluate	VERB
bjmsr-366	17	15	in	in	ADP
bjmsr-366	17	16	advance	advance	NOUN
bjmsr-366	17	17	on	on	ADP
bjmsr-366	17	18	the	the	DET
bjmsr-366	17	19	given	give	VERB
bjmsr-366	17	20	transportation	transportation	NOUN
bjmsr-366	17	21	network	network	NOUN
bjmsr-366	17	22	.	.	PUNCT
bjmsr-366	18	1	keywords	keyword	NOUN
bjmsr-366	18	2	:	:	PUNCT
bjmsr-366	18	3	shortest	short	ADJ
bjmsr-366	18	4	path	path	NOUN
bjmsr-366	18	5	;	;	PUNCT
bjmsr-366	18	6	dijkstra	dijkstra	PROPN
bjmsr-366	18	7	’s	’s	PART
bjmsr-366	18	8	algorithm	algorithm	NOUN
bjmsr-366	18	9	;	;	PUNCT
bjmsr-366	18	10	breadth	breadth	NOUN
bjmsr-366	18	11	first	first	ADJ
bjmsr-366	18	12	search	search	NOUN
bjmsr-366	18	13	;	;	PUNCT
bjmsr-366	18	14	maximum	maximum	ADJ
bjmsr-366	18	15	number	number	NOUN
bjmsr-366	18	16	of	of	ADP
bjmsr-366	18	17	nodes	node	NOUN
bjmsr-366	18	18	.	.	PUNCT
bjmsr-366	19	1	1	1	X
bjmsr-366	19	2	.	.	X
bjmsr-366	19	3	introduction	introduction	NOUN
bjmsr-366	19	4	this	this	DET
bjmsr-366	19	5	paper	paper	NOUN
bjmsr-366	19	6	involved	involve	VERB
bjmsr-366	19	7	in	in	ADP
bjmsr-366	19	8	illustrating	illustrate	VERB
bjmsr-366	19	9	the	the	DET
bjmsr-366	19	10	best	good	ADJ
bjmsr-366	19	11	way	way	NOUN
bjmsr-366	19	12	to	to	PART
bjmsr-366	19	13	travel	travel	VERB
bjmsr-366	19	14	between	between	ADP
bjmsr-366	19	15	two	two	NUM
bjmsr-366	19	16	points	point	NOUN
bjmsr-366	19	17	and	and	CCONJ
bjmsr-366	19	18	in	in	ADP
bjmsr-366	19	19	doing	do	VERB
bjmsr-366	19	20	so	so	ADV
bjmsr-366	19	21	,	,	PUNCT
bjmsr-366	19	22	the	the	DET
bjmsr-366	19	23	shortest	short	ADJ
bjmsr-366	19	24	path	path	NOUN
bjmsr-366	19	25	algorithm	algorithm	NOUN
bjmsr-366	19	26	was	be	AUX
bjmsr-366	19	27	created	create	VERB
bjmsr-366	19	28	.	.	PUNCT
bjmsr-366	20	1	dijkstra‘s	dijkstra‘s	PROPN
bjmsr-366	20	2	algorithm	algorithm	NOUN
bjmsr-366	20	3	is	be	AUX
bjmsr-366	20	4	a	a	DET
bjmsr-366	20	5	graph	graph	NOUN
bjmsr-366	20	6	search	search	NOUN
bjmsr-366	20	7	algorithm	algorithm	NOUN
bjmsr-366	20	8	that	that	PRON
bjmsr-366	20	9	solves	solve	VERB
bjmsr-366	20	10	the	the	DET
bjmsr-366	20	11	single	single	ADJ
bjmsr-366	20	12	-	-	PUNCT
bjmsr-366	20	13	source	source	NOUN
bjmsr-366	20	14	shortest	short	ADJ
bjmsr-366	20	15	path	path	NOUN
bjmsr-366	20	16	problem	problem	NOUN
bjmsr-366	20	17	for	for	ADP
bjmsr-366	20	18	a	a	DET
bjmsr-366	20	19	graph	graph	NOUN
bjmsr-366	20	20	with	with	ADP
bjmsr-366	20	21	nonnegative	nonnegative	ADJ
bjmsr-366	20	22	edge	edge	NOUN
bjmsr-366	20	23	path	path	NOUN
bjmsr-366	20	24	costs	cost	NOUN
bjmsr-366	20	25	,	,	PUNCT
bjmsr-366	20	26	producing	produce	VERB
bjmsr-366	20	27	a	a	DET
bjmsr-366	20	28	shortest	short	ADJ
bjmsr-366	20	29	path	path	NOUN
bjmsr-366	20	30	tree	tree	NOUN
bjmsr-366	20	31	.	.	PUNCT
bjmsr-366	21	1	this	this	DET
bjmsr-366	21	2	algorithm	algorithm	NOUN
bjmsr-366	21	3	is	be	AUX
bjmsr-366	21	4	often	often	ADV
bjmsr-366	21	5	used	use	VERB
bjmsr-366	21	6	in	in	ADP
bjmsr-366	21	7	routing	routing	NOUN
bjmsr-366	21	8	and	and	CCONJ
bjmsr-366	21	9	other	other	ADJ
bjmsr-366	21	10	network	network	NOUN
bjmsr-366	21	11	related	relate	VERB
bjmsr-366	21	12	protocols	protocol	NOUN
bjmsr-366	21	13	.	.	PUNCT
bjmsr-366	22	1	for	for	ADP
bjmsr-366	22	2	a	a	DET
bjmsr-366	22	3	given	give	VERB
bjmsr-366	22	4	source	source	NOUN
bjmsr-366	22	5	vertex	vertex	NOUN
bjmsr-366	22	6	(	(	PUNCT
bjmsr-366	22	7	node	node	NOUN
bjmsr-366	22	8	)	)	PUNCT
bjmsr-366	22	9	in	in	ADP
bjmsr-366	22	10	the	the	DET
bjmsr-366	22	11	graph	graph	NOUN
bjmsr-366	22	12	,	,	PUNCT
bjmsr-366	22	13	the	the	DET
bjmsr-366	22	14	algorithm	algorithm	NOUN
bjmsr-366	22	15	finds	find	VERB
bjmsr-366	22	16	the	the	DET
bjmsr-366	22	17	s	s	NOUN
bjmsr-366	22	18	finding	finding	NOUN
bjmsr-366	22	19	costs	cost	NOUN
bjmsr-366	22	20	of	of	ADP
bjmsr-366	22	21	shortest	short	ADJ
bjmsr-366	22	22	paths	path	NOUN
bjmsr-366	22	23	from	from	ADP
bjmsr-366	22	24	a	a	DET
bjmsr-366	22	25	single	single	ADJ
bjmsr-366	22	26	vertex	vertex	NOUN
bjmsr-366	22	27	to	to	ADP
bjmsr-366	22	28	a	a	DET
bjmsr-366	22	29	single	single	ADJ
bjmsr-366	22	30	destination	destination	NOUN
bjmsr-366	22	31	vertex	vertex	NOUN
bjmsr-366	22	32	by	by	ADP
bjmsr-366	22	33	stopping	stop	VERB
bjmsr-366	22	34	the	the	DET
bjmsr-366	22	35	algorithm	algorithm	NOUN
bjmsr-366	22	36	once	once	SCONJ
bjmsr-366	22	37	the	the	DET
bjmsr-366	22	38	shortest	short	ADJ
bjmsr-366	22	39	path	path	NOUN
bjmsr-366	22	40	to	to	ADP
bjmsr-366	22	41	the	the	DET
bjmsr-366	22	42	destination	destination	NOUN
bjmsr-366	22	43	vertex	vertex	NOUN
bjmsr-366	22	44	has	have	AUX
bjmsr-366	22	45	been	be	AUX
bjmsr-366	22	46	determined	determine	VERB
bjmsr-366	22	47	.	.	PUNCT
bjmsr-366	23	1	for	for	ADP
bjmsr-366	23	2	example	example	NOUN
bjmsr-366	23	3	,	,	PUNCT
bjmsr-366	23	4	if	if	SCONJ
bjmsr-366	23	5	the	the	DET
bjmsr-366	23	6	vertices	vertex	NOUN
bjmsr-366	23	7	of	of	ADP
bjmsr-366	23	8	the	the	DET
bjmsr-366	23	9	graph	graph	NOUN
bjmsr-366	23	10	represent	represent	VERB
bjmsr-366	23	11	cities	city	NOUN
bjmsr-366	23	12	and	and	CCONJ
bjmsr-366	23	13	edge	edge	NOUN
bjmsr-366	23	14	path	path	NOUN
bjmsr-366	23	15	costs	cost	NOUN
bjmsr-366	23	16	represent	represent	VERB
bjmsr-366	23	17	driving	drive	VERB
bjmsr-366	23	18	distances	distance	NOUN
bjmsr-366	23	19	between	between	ADP
bjmsr-366	23	20	pairs	pair	NOUN
bjmsr-366	23	21	of	of	ADP
bjmsr-366	23	22	cities	city	NOUN
bjmsr-366	23	23	connected	connect	VERB
bjmsr-366	23	24	by	by	ADP
bjmsr-366	23	25	a	a	DET
bjmsr-366	23	26	direct	direct	ADJ
bjmsr-366	23	27	road	road	NOUN
bjmsr-366	23	28	,	,	PUNCT
bjmsr-366	23	29	dijkstra	dijkstra	PROPN
bjmsr-366	23	30	's	's	PART
bjmsr-366	23	31	algorithm	algorithm	NOUN
bjmsr-366	23	32	can	can	AUX
bjmsr-366	23	33	be	be	AUX
bjmsr-366	23	34	used	use	VERB
bjmsr-366	23	35	to	to	PART
bjmsr-366	23	36	find	find	VERB
bjmsr-366	23	37	the	the	DET
bjmsr-366	23	38	shortest	short	ADJ
bjmsr-366	23	39	route	route	NOUN
bjmsr-366	23	40	between	between	ADP
bjmsr-366	23	41	one	one	NUM
bjmsr-366	23	42	city	city	NOUN
bjmsr-366	23	43	and	and	CCONJ
bjmsr-366	23	44	all	all	DET
bjmsr-366	23	45	other	other	ADJ
bjmsr-366	23	46	cities	city	NOUN
bjmsr-366	23	47	.	.	PUNCT
bjmsr-366	24	1	a	a	DET
bjmsr-366	24	2	large	large	ADJ
bjmsr-366	24	3	amount	amount	NOUN
bjmsr-366	24	4	of	of	ADP
bjmsr-366	24	5	work	work	NOUN
bjmsr-366	24	6	has	have	AUX
bjmsr-366	24	7	been	be	AUX
bjmsr-366	24	8	done	do	VERB
bjmsr-366	24	9	on	on	ADP
bjmsr-366	24	10	finding	find	VERB
bjmsr-366	24	11	shortest	short	ADJ
bjmsr-366	24	12	paths	path	NOUN
bjmsr-366	24	13	through	through	ADP
bjmsr-366	24	14	abstract	abstract	NOUN
bjmsr-366	24	15	.	.	PUNCT
bjmsr-366	25	1	dijkstra‘s	dijkstra‘s	PROPN
bjmsr-366	25	2	algorithm	algorithm	NOUN
bjmsr-366	25	3	is	be	AUX
bjmsr-366	25	4	a	a	DET
bjmsr-366	25	5	shortest	short	ADJ
bjmsr-366	25	6	path	path	NOUN
bjmsr-366	25	7	finding	find	VERB
bjmsr-366	25	8	algorithm	algorithm	NOUN
bjmsr-366	25	9	which	which	PRON
bjmsr-366	25	10	is	be	AUX
bjmsr-366	25	11	applicable	applicable	ADJ
bjmsr-366	25	12	on	on	ADP
bjmsr-366	25	13	a	a	DET
bjmsr-366	25	14	graph	graph	NOUN
bjmsr-366	25	15	which	which	PRON
bjmsr-366	25	16	is	be	AUX
bjmsr-366	25	17	directed	direct	VERB
bjmsr-366	25	18	and	and	CCONJ
bjmsr-366	25	19	got	get	VERB
bjmsr-366	25	20	the	the	DET
bjmsr-366	25	21	edges	edge	NOUN
bjmsr-366	25	22	weighted	weight	VERB
bjmsr-366	25	23	with	with	ADP
bjmsr-366	25	24	non	non	ADJ
bjmsr-366	25	25	-	-	ADJ
bjmsr-366	25	26	negative	negative	ADJ
bjmsr-366	25	27	weights	weight	NOUN
bjmsr-366	25	28	.	.	PUNCT
bjmsr-366	26	1	if	if	SCONJ
bjmsr-366	26	2	we	we	PRON
bjmsr-366	26	3	have	have	VERB
bjmsr-366	26	4	an	an	DET
bjmsr-366	26	5	undirected	undirected	ADJ
bjmsr-366	26	6	graph	graph	NOUN
bjmsr-366	26	7	with	with	ADP
bjmsr-366	26	8	edges	edge	NOUN
bjmsr-366	26	9	unweighted	unweighte	VERB
bjmsr-366	26	10	,	,	PUNCT
bjmsr-366	26	11	we	we	PRON
bjmsr-366	26	12	can	can	AUX
bjmsr-366	26	13	solve	solve	VERB
bjmsr-366	26	14	the	the	DET
bjmsr-366	26	15	problem	problem	NOUN
bjmsr-366	26	16	with	with	ADP
bjmsr-366	26	17	the	the	DET
bjmsr-366	26	18	implementation	implementation	NOUN
bjmsr-366	26	19	of	of	ADP
bjmsr-366	26	20	breadth	breadth	NOUN
bjmsr-366	26	21	first	first	ADJ
bjmsr-366	26	22	search	search	NOUN
bjmsr-366	26	23	(	(	PUNCT
bjmsr-366	26	24	bfs	bfs	NOUN
bjmsr-366	26	25	)	)	PUNCT
bjmsr-366	26	26	algorithm	algorithm	NOUN
bjmsr-366	26	27	.	.	PUNCT
bjmsr-366	27	1	as	as	SCONJ
bjmsr-366	27	2	we	we	PRON
bjmsr-366	27	3	know	know	VERB
bjmsr-366	27	4	we	we	PRON
bjmsr-366	27	5	are	be	AUX
bjmsr-366	27	6	unable	unable	ADJ
bjmsr-366	27	7	to	to	PART
bjmsr-366	27	8	use	use	VERB
bjmsr-366	27	9	bfs	bfs	NOUN
bjmsr-366	27	10	algorithm	algorithm	NOUN
bjmsr-366	27	11	in	in	ADP
bjmsr-366	27	12	case	case	NOUN
bjmsr-366	27	13	of	of	ADP
bjmsr-366	27	14	a	a	DET
bjmsr-366	27	15	weighted	weight	VERB
bjmsr-366	27	16	and	and	CCONJ
bjmsr-366	27	17	directed	direct	VERB
bjmsr-366	27	18	graph	graph	NOUN
bjmsr-366	27	19	,	,	PUNCT
bjmsr-366	27	20	but	but	CCONJ
bjmsr-366	27	21	we	we	PRON
bjmsr-366	27	22	can	can	AUX
bjmsr-366	27	23	modify	modify	VERB
bjmsr-366	27	24	our	our	PRON
bjmsr-366	27	25	algorithm	algorithm	NOUN
bjmsr-366	27	26	of	of	ADP
bjmsr-366	27	27	bfs	bfs	NOUN
bjmsr-366	27	28	in	in	ADP
bjmsr-366	27	29	such	such	DET
bjmsr-366	27	30	a	a	DET
bjmsr-366	27	31	way	way	NOUN
bjmsr-366	27	32	that	that	PRON
bjmsr-366	27	33	we	we	PRON
bjmsr-366	27	34	can	can	AUX
bjmsr-366	27	35	handle	handle	VERB
bjmsr-366	27	36	the	the	DET
bjmsr-366	27	37	above	above	ADJ
bjmsr-366	27	38	stated	stated	ADJ
bjmsr-366	27	39	issues	issue	NOUN
bjmsr-366	27	40	(	(	PUNCT
bjmsr-366	27	41	weights	weight	NOUN
bjmsr-366	27	42	and	and	CCONJ
bjmsr-366	27	43	direction	direction	NOUN
bjmsr-366	27	44	)	)	PUNCT
bjmsr-366	27	45	.	.	PUNCT
bjmsr-366	28	1	we	we	PRON
bjmsr-366	28	2	will	will	AUX
bjmsr-366	28	3	later	later	ADV
bjmsr-366	28	4	know	know	VERB
bjmsr-366	28	5	that	that	SCONJ
bjmsr-366	28	6	dijkstra‘s	dijkstra‘s	PROPN
bjmsr-366	28	7	algorithm	algorithm	NOUN
bjmsr-366	28	8	is	be	AUX
bjmsr-366	28	9	asymptotically	asymptotically	ADV
bjmsr-366	28	10	the	the	DET
bjmsr-366	28	11	fastest	fast	ADV
bjmsr-366	28	12	known	know	VERB
bjmsr-366	28	13	single	single	ADJ
bjmsr-366	28	14	-	-	PUNCT
bjmsr-366	28	15	source	source	NOUN
bjmsr-366	28	16	shortest	short	ADJ
bjmsr-366	28	17	-	-	PUNCT
bjmsr-366	28	18	path	path	NOUN
bjmsr-366	28	19	algorithm	algorithm	NOUN
bjmsr-366	28	20	for	for	ADP
bjmsr-366	28	21	arbitrary	arbitrary	ADJ
bjmsr-366	28	22	directed	direct	VERB
bjmsr-366	28	23	copyright	copyright	NOUN
bjmsr-366	28	24	©	©	PROPN
bjmsr-366	28	25	cc	cc	PROPN
bjmsr-366	28	26	-	-	PUNCT
bjmsr-366	28	27	by	by	ADP
bjmsr-366	28	28	-	-	PUNCT
bjmsr-366	28	29	nc	nc	PROPN
bjmsr-366	28	30	2019	2019	NUM
bjmsr-366	28	31	,	,	PUNCT
bjmsr-366	28	32	bjmsr	bjmsr	PROPN
bjmsr-366	28	33	www.cribfb.com/journal/index.php/bjmsr	www.cribfb.com/journal/index.php/bjmsr	X
bjmsr-366	28	34	bangladesh	bangladesh	PROPN
bjmsr-366	28	35	journal	journal	PROPN
bjmsr-366	28	36	of	of	ADP
bjmsr-366	28	37	multidisciplinary	multidisciplinary	ADJ
bjmsr-366	28	38	scientific	scientific	ADJ
bjmsr-366	28	39	research	research	NOUN
bjmsr-366	28	40	vol	vol	NOUN
bjmsr-366	28	41	.	.	PROPN
bjmsr-366	29	1	1	1	NUM
bjmsr-366	29	2	,	,	PUNCT
bjmsr-366	29	3	no	no	INTJ
bjmsr-366	29	4	.	.	NOUN
bjmsr-366	29	5	2	2	NUM
bjmsr-366	29	6	;	;	PUNCT
bjmsr-366	29	7	2019	2019	NUM
bjmsr-366	29	8	42	42	NUM
bjmsr-366	29	9	graphs	graph	NOUN
bjmsr-366	29	10	with	with	ADP
bjmsr-366	29	11	unbounded	unbounded	ADJ
bjmsr-366	29	12	nonnegative	nonnegative	ADJ
bjmsr-366	29	13	weights	weight	NOUN
bjmsr-366	29	14	.	.	PUNCT
bjmsr-366	30	1	these	these	PRON
bjmsr-366	30	2	are	be	AUX
bjmsr-366	30	3	the	the	DET
bjmsr-366	30	4	motivations	motivation	NOUN
bjmsr-366	30	5	those	those	PRON
bjmsr-366	30	6	will	will	AUX
bjmsr-366	30	7	help	help	VERB
bjmsr-366	30	8	us	we	PRON
bjmsr-366	30	9	to	to	PART
bjmsr-366	30	10	know	know	VERB
bjmsr-366	30	11	about	about	ADP
bjmsr-366	30	12	the	the	DET
bjmsr-366	30	13	dijkstra	dijkstra	PROPN
bjmsr-366	30	14	’s	’s	PART
bjmsr-366	30	15	algorithm	algorithm	NOUN
bjmsr-366	30	16	more	more	ADV
bjmsr-366	30	17	in	in	ADP
bjmsr-366	30	18	future	future	NOUN
bjmsr-366	30	19	.	.	PUNCT
bjmsr-366	31	1	2	2	X
bjmsr-366	31	2	.	.	X
bjmsr-366	31	3	related	relate	VERB
bjmsr-366	31	4	works	work	VERB
bjmsr-366	31	5	the	the	DET
bjmsr-366	31	6	indoor	indoor	ADJ
bjmsr-366	31	7	navigational	navigational	ADJ
bjmsr-366	31	8	assistance	assistance	NOUN
bjmsr-366	31	9	for	for	ADP
bjmsr-366	31	10	this	this	DET
bjmsr-366	31	11	type	type	NOUN
bjmsr-366	31	12	of	of	ADP
bjmsr-366	31	13	users	user	NOUN
bjmsr-366	31	14	presents	present	VERB
bjmsr-366	31	15	additional	additional	ADJ
bjmsr-366	31	16	challenges	challenge	NOUN
bjmsr-366	31	17	not	not	PART
bjmsr-366	31	18	faced	face	VERB
bjmsr-366	31	19	by	by	ADP
bjmsr-366	31	20	convention	convention	NOUN
bjmsr-366	31	21	alguidance	alguidance	NOUN
bjmsr-366	31	22	systems	system	NOUN
bjmsr-366	31	23	,	,	PUNCT
bjmsr-366	31	24	due	due	ADP
bjmsr-366	31	25	to	to	ADP
bjmsr-366	31	26	the	the	DET
bjmsr-366	31	27	personal	personal	ADJ
bjmsr-366	31	28	nature	nature	NOUN
bjmsr-366	31	29	of	of	ADP
bjmsr-366	31	30	the	the	DET
bjmsr-366	31	31	interactions	interaction	NOUN
bjmsr-366	31	32	.	.	PUNCT
bjmsr-366	32	1	the	the	DET
bjmsr-366	32	2	algorithms	algorithm	NOUN
bjmsr-366	32	3	are	be	AUX
bjmsr-366	32	4	part	part	NOUN
bjmsr-366	32	5	of	of	ADP
bjmsr-366	32	6	an	an	DET
bjmsr-366	32	7	overall	overall	ADJ
bjmsr-366	32	8	indoor	indoor	ADJ
bjmsr-366	32	9	navigation	navigation	NOUN
bjmsr-366	32	10	model	model	NOUN
bjmsr-366	32	11	that	that	PRON
bjmsr-366	32	12	is	be	AUX
bjmsr-366	32	13	used	use	VERB
bjmsr-366	32	14	to	to	PART
bjmsr-366	32	15	provide	provide	VERB
bjmsr-366	32	16	assistance	assistance	NOUN
bjmsr-366	32	17	and	and	CCONJ
bjmsr-366	32	18	guidance	guidance	NOUN
bjmsr-366	32	19	in	in	ADP
bjmsr-366	32	20	unfamiliar	unfamiliar	ADJ
bjmsr-366	32	21	indoor	indoor	ADJ
bjmsr-366	32	22	environments	environment	NOUN
bjmsr-366	32	23	.	.	PUNCT
bjmsr-366	33	1	path	path	NOUN
bjmsr-366	33	2	planning	planning	NOUN
bjmsr-366	33	3	guses	guse	NOUN
bjmsr-366	33	4	the	the	DET
bjmsr-366	33	5	dijkstra	dijkstra	PROPN
bjmsr-366	33	6	's	's	PART
bjmsr-366	33	7	shortest	short	ADJ
bjmsr-366	33	8	path	path	NOUN
bjmsr-366	33	9	algorithms	algorithm	NOUN
bjmsr-366	33	10	,	,	PUNCT
bjmsr-366	33	11	to	to	PART
bjmsr-366	33	12	operate	operate	VERB
bjmsr-366	33	13	on	on	ADP
bjmsr-366	33	14	an	an	DET
bjmsr-366	33	15	"	"	PUNCT
bjmsr-366	33	16	intelligent	intelligent	ADJ
bjmsr-366	33	17	map	map	NOUN
bjmsr-366	33	18	"	"	PUNCT
bjmsr-366	33	19	,	,	PUNCT
bjmsr-366	33	20	that	that	PRON
bjmsr-366	33	21	is	be	AUX
bjmsr-366	33	22	based	base	VERB
bjmsr-366	33	23	on	on	ADP
bjmsr-366	33	24	a	a	DET
bjmsr-366	33	25	new	new	ADJ
bjmsr-366	33	26	data	data	NOUN
bjmsr-366	33	27	structure	structure	NOUN
bjmsr-366	33	28	termed	term	VERB
bjmsr-366	33	29	"	"	PUNCT
bjmsr-366	33	30	cactus	cactus	NOUN
bjmsr-366	33	31	tree	tree	NOUN
bjmsr-366	33	32	"	"	PUNCT
bjmsr-366	33	33	which	which	PRON
bjmsr-366	33	34	is	be	AUX
bjmsr-366	33	35	predicated	predicate	VERB
bjmsr-366	33	36	on	on	ADP
bjmsr-366	33	37	the	the	DET
bjmsr-366	33	38	relationships	relationship	NOUN
bjmsr-366	33	39	between	between	ADP
bjmsr-366	33	40	the	the	DET
bjmsr-366	33	41	different	different	ADJ
bjmsr-366	33	42	objects	object	NOUN
bjmsr-366	33	43	that	that	PRON
bjmsr-366	33	44	represent	represent	VERB
bjmsr-366	33	45	an	an	DET
bjmsr-366	33	46	indoor	indoor	ADJ
bjmsr-366	33	47	environment	environment	NOUN
bjmsr-366	33	48	.	.	PUNCT
bjmsr-366	34	1	this	this	DET
bjmsr-366	34	2	research	research	NOUN
bjmsr-366	34	3	explores	explore	VERB
bjmsr-366	34	4	the	the	DET
bjmsr-366	34	5	potential	potential	NOUN
bjmsr-366	34	6	to	to	PART
bjmsr-366	34	7	design	design	VERB
bjmsr-366	34	8	an	an	DET
bjmsr-366	34	9	application	application	NOUN
bjmsr-366	34	10	for	for	ADP
bjmsr-366	34	11	the	the	DET
bjmsr-366	34	12	visually	visually	ADV
bjmsr-366	34	13	impaired	impaired	ADJ
bjmsr-366	34	14	even	even	ADV
bjmsr-366	34	15	when	when	SCONJ
bjmsr-366	34	16	todate	todate	VERB
bjmsr-366	34	17	'	'	PUNCT
bjmsr-366	34	18	positioning	positioning	NOUN
bjmsr-366	34	19	and	and	CCONJ
bjmsr-366	34	20	tracking	tracking	NOUN
bjmsr-366	34	21	'	'	PUNCT
bjmsr-366	34	22	system	system	NOUN
bjmsr-366	34	23	can	can	AUX
bjmsr-366	34	24	not	not	PART
bjmsr-366	34	25	offer	offer	VERB
bjmsr-366	34	26	reliable	reliable	ADJ
bjmsr-366	34	27	position	position	NOUN
bjmsr-366	34	28	information	information	NOUN
bjmsr-366	34	29	that	that	PRON
bjmsr-366	34	30	highly	highly	ADV
bjmsr-366	34	31	required	require	VERB
bjmsr-366	34	32	by	by	ADP
bjmsr-366	34	33	this	this	DET
bjmsr-366	34	34	type	type	NOUN
bjmsr-366	34	35	of	of	ADP
bjmsr-366	34	36	application	application	NOUN
bjmsr-366	34	37	.	.	PUNCT
bjmsr-366	35	1	the	the	DET
bjmsr-366	35	2	best	good	ADJ
bjmsr-366	35	3	-	-	PUNCT
bjmsr-366	35	4	path	path	NOUN
bjmsr-366	35	5	problem	problem	NOUN
bjmsr-366	35	6	for	for	ADP
bjmsr-366	35	7	public	public	ADJ
bjmsr-366	35	8	transportation	transportation	NOUN
bjmsr-366	35	9	systems	system	NOUN
bjmsr-366	35	10	,	,	PUNCT
bjmsr-366	35	11	we	we	PRON
bjmsr-366	35	12	found	find	VERB
bjmsr-366	35	13	that	that	SCONJ
bjmsr-366	35	14	the	the	DET
bjmsr-366	35	15	nature	nature	NOUN
bjmsr-366	35	16	of	of	ADP
bjmsr-366	35	17	transfer	transfer	NOUN
bjmsr-366	35	18	is	be	AUX
bjmsr-366	35	19	that	that	SCONJ
bjmsr-366	35	20	it	it	PRON
bjmsr-366	35	21	requires	require	VERB
bjmsr-366	35	22	extra	extra	ADJ
bjmsr-366	35	23	costs	cost	NOUN
bjmsr-366	35	24	from	from	ADP
bjmsr-366	35	25	an	an	DET
bjmsr-366	35	26	edge	edge	NOUN
bjmsr-366	35	27	to	to	ADP
bjmsr-366	35	28	its	its	PRON
bjmsr-366	35	29	adjacent	adjacent	ADJ
bjmsr-366	35	30	edge	edge	NOUN
bjmsr-366	35	31	.	.	PUNCT
bjmsr-366	36	1	so	so	ADV
bjmsr-366	36	2	,	,	PUNCT
bjmsr-366	36	3	we	we	PRON
bjmsr-366	36	4	use	use	VERB
bjmsr-366	36	5	the	the	DET
bjmsr-366	36	6	direct	direct	ADJ
bjmsr-366	36	7	/	/	SYM
bjmsr-366	36	8	indirect	indirect	ADJ
bjmsr-366	36	9	adjacent	adjacent	ADJ
bjmsr-366	36	10	edges	edge	NOUN
bjmsr-366	36	11	weighted	weight	VERB
bjmsr-366	36	12	directed	direct	VERB
bjmsr-366	36	13	graph	graph	NOUN
bjmsr-366	36	14	as	as	ADP
bjmsr-366	36	15	a	a	DET
bjmsr-366	36	16	public	public	ADJ
bjmsr-366	36	17	transportation	transportation	NOUN
bjmsr-366	36	18	data	datum	NOUN
bjmsr-366	36	19	model	model	NOUN
bjmsr-366	36	20	and	and	CCONJ
bjmsr-366	36	21	improve	improve	VERB
bjmsr-366	36	22	the	the	DET
bjmsr-366	36	23	storage	storage	NOUN
bjmsr-366	36	24	of	of	ADP
bjmsr-366	36	25	an	an	DET
bjmsr-366	36	26	adjacency	adjacency	NOUN
bjmsr-366	36	27	matrix	matrix	NOUN
bjmsr-366	36	28	.	.	PUNCT
bjmsr-366	37	1	we	we	PRON
bjmsr-366	37	2	introduce	introduce	VERB
bjmsr-366	37	3	the	the	DET
bjmsr-366	37	4	spaces	space	NOUN
bjmsr-366	37	5	to	to	PART
bjmsr-366	37	6	rage	rage	VERB
bjmsr-366	37	7	structure	structure	NOUN
bjmsr-366	37	8	in	in	ADP
bjmsr-366	37	9	order	order	NOUN
bjmsr-366	37	10	to	to	PART
bjmsr-366	37	11	store	store	VERB
bjmsr-366	37	12	the	the	DET
bjmsr-366	37	13	scattered	scatter	VERB
bjmsr-366	37	14	information	information	NOUN
bjmsr-366	37	15	of	of	ADP
bjmsr-366	37	16	transfer	transfer	NOUN
bjmsr-366	37	17	in	in	ADP
bjmsr-366	37	18	indirect	indirect	ADJ
bjmsr-366	37	19	adjacent	adjacent	ADJ
bjmsr-366	37	20	edges	edge	NOUN
bjmsr-366	37	21	lists	list	NOUN
bjmsr-366	37	22	.	.	PUNCT
bjmsr-366	38	1	thus	thus	ADV
bjmsr-366	38	2	,	,	PUNCT
bjmsr-366	38	3	we	we	PRON
bjmsr-366	38	4	solve	solve	VERB
bjmsr-366	38	5	the	the	DET
bjmsr-366	38	6	problem	problem	NOUN
bjmsr-366	38	7	of	of	ADP
bjmsr-366	38	8	complex	complex	ADJ
bjmsr-366	38	9	network	network	NOUN
bjmsr-366	38	10	graphs	graph	NOUN
bjmsr-366	38	11	'	'	PART
bjmsr-366	38	12	storage	storage	NOUN
bjmsr-366	38	13	and	and	CCONJ
bjmsr-366	38	14	design	design	VERB
bjmsr-366	38	15	a	a	DET
bjmsr-366	38	16	new	new	ADJ
bjmsr-366	38	17	shortest	short	ADJ
bjmsr-366	38	18	path	path	NOUN
bjmsr-366	38	19	algorithm	algorithm	NOUN
bjmsr-366	38	20	to	to	PART
bjmsr-366	38	21	solve	solve	VERB
bjmsr-366	38	22	transit	transit	NOUN
bjmsr-366	38	23	problem	problem	NOUN
bjmsr-366	38	24	based	base	VERB
bjmsr-366	38	25	on	on	ADP
bjmsr-366	38	26	the	the	DET
bjmsr-366	38	27	data	data	NOUN
bjmsr-366	38	28	model	model	NOUN
bjmsr-366	38	29	.	.	PUNCT
bjmsr-366	39	1	algorithm	algorithm	NOUN
bjmsr-366	39	2	analysis	analysis	NOUN
bjmsr-366	39	3	exhibits	exhibit	VERB
bjmsr-366	39	4	that	that	SCONJ
bjmsr-366	39	5	the	the	DET
bjmsr-366	39	6	data	data	NOUN
bjmsr-366	39	7	model	model	NOUN
bjmsr-366	39	8	and	and	CCONJ
bjmsr-366	39	9	the	the	DET
bjmsr-366	39	10	algorithm	algorithm	NOUN
bjmsr-366	39	11	we	we	PRON
bjmsr-366	39	12	propose	propose	VERB
bjmsr-366	39	13	are	be	AUX
bjmsr-366	39	14	prior	prior	ADV
bjmsr-366	39	15	to	to	ADP
bjmsr-366	39	16	a	a	DET
bjmsr-366	39	17	simple	simple	ADJ
bjmsr-366	39	18	graph	graph	NOUN
bjmsr-366	39	19	based	base	VERB
bjmsr-366	39	20	on	on	ADP
bjmsr-366	39	21	the	the	DET
bjmsr-366	39	22	dijkstra	dijkstra	PROPN
bjmsr-366	39	23	's	's	PART
bjmsr-366	39	24	algorithm	algorithm	NOUN
bjmsr-366	39	25	in	in	ADP
bjmsr-366	39	26	terms	term	NOUN
bjmsr-366	39	27	of	of	ADP
bjmsr-366	39	28	time	time	NOUN
bjmsr-366	39	29	and	and	CCONJ
bjmsr-366	39	30	space	space	NOUN
bjmsr-366	39	31	.	.	PUNCT
bjmsr-366	40	1	today	today	NOUN
bjmsr-366	40	2	,	,	PUNCT
bjmsr-366	40	3	the	the	DET
bjmsr-366	40	4	increased	increase	VERB
bjmsr-366	40	5	traffic	traffic	NOUN
bjmsr-366	40	6	and	and	CCONJ
bjmsr-366	40	7	complex	complex	ADJ
bjmsr-366	40	8	modern	modern	ADJ
bjmsr-366	40	9	road	road	NOUN
bjmsr-366	40	10	network	network	NOUN
bjmsr-366	40	11	have	have	AUX
bjmsr-366	40	12	made	make	VERB
bjmsr-366	40	13	finding	find	VERB
bjmsr-366	40	14	a	a	DET
bjmsr-366	40	15	good	good	ADJ
bjmsr-366	40	16	route	route	NOUN
bjmsr-366	40	17	from	from	ADP
bjmsr-366	40	18	one	one	NUM
bjmsr-366	40	19	location	location	NOUN
bjmsr-366	40	20	to	to	ADP
bjmsr-366	40	21	another	another	PRON
bjmsr-366	40	22	a	a	DET
bjmsr-366	40	23	non	non	ADJ
bjmsr-366	40	24	-	-	ADJ
bjmsr-366	40	25	trivial	trivial	ADJ
bjmsr-366	40	26	task	task	NOUN
bjmsr-366	40	27	.	.	PUNCT
bjmsr-366	41	1	many	many	ADJ
bjmsr-366	41	2	search	search	NOUN
bjmsr-366	41	3	algorithms	algorithm	NOUN
bjmsr-366	41	4	have	have	AUX
bjmsr-366	41	5	been	be	AUX
bjmsr-366	41	6	proposed	propose	VERB
bjmsr-366	41	7	to	to	PART
bjmsr-366	41	8	solve	solve	VERB
bjmsr-366	41	9	the	the	DET
bjmsr-366	41	10	problem	problem	NOUN
bjmsr-366	41	11	,	,	PUNCT
bjmsr-366	41	12	and	and	CCONJ
bjmsr-366	41	13	the	the	DET
bjmsr-366	41	14	most	most	ADV
bjmsr-366	41	15	well	well	ADV
bjmsr-366	41	16	-	-	PUNCT
bjmsr-366	41	17	known	know	VERB
bjmsr-366	41	18	being	be	AUX
bjmsr-366	41	19	dijkstra	dijkstra	PROPN
bjmsr-366	41	20	's	's	PART
bjmsr-366	41	21	algorithm	algorithm	NOUN
bjmsr-366	41	22	,	,	PUNCT
bjmsr-366	41	23	johnson	johnson	PROPN
bjmsr-366	41	24	's	's	PART
bjmsr-366	41	25	algorithm	algorithm	NOUN
bjmsr-366	41	26	.	.	PUNCT
bjmsr-366	42	1	while	while	SCONJ
bjmsr-366	42	2	these	these	DET
bjmsr-366	42	3	algorithms	algorithm	NOUN
bjmsr-366	42	4	are	be	AUX
bjmsr-366	42	5	effective	effective	ADJ
bjmsr-366	42	6	for	for	ADP
bjmsr-366	42	7	path	path	NOUN
bjmsr-366	42	8	finding	finding	NOUN
bjmsr-366	42	9	,	,	PUNCT
bjmsr-366	42	10	they	they	PRON
bjmsr-366	42	11	are	be	AUX
bjmsr-366	42	12	wasteful	wasteful	ADJ
bjmsr-366	42	13	in	in	ADP
bjmsr-366	42	14	terms	term	NOUN
bjmsr-366	42	15	of	of	ADP
bjmsr-366	42	16	computation	computation	NOUN
bjmsr-366	42	17	.	.	PUNCT
bjmsr-366	43	1	in	in	ADP
bjmsr-366	43	2	this	this	DET
bjmsr-366	43	3	paper	paper	NOUN
bjmsr-366	43	4	,	,	PUNCT
bjmsr-366	43	5	we	we	PRON
bjmsr-366	43	6	present	present	VERB
bjmsr-366	43	7	a	a	DET
bjmsr-366	43	8	study	study	NOUN
bjmsr-366	43	9	to	to	PART
bjmsr-366	43	10	examine	examine	VERB
bjmsr-366	43	11	both	both	CCONJ
bjmsr-366	43	12	uninformed	uninformed	ADJ
bjmsr-366	43	13	search	search	NOUN
bjmsr-366	43	14	and	and	CCONJ
bjmsr-366	43	15	heuristic	heuristic	ADJ
bjmsr-366	43	16	search	search	NOUN
bjmsr-366	43	17	based	base	VERB
bjmsr-366	43	18	on	on	ADP
bjmsr-366	43	19	some	some	DET
bjmsr-366	43	20	major	major	ADJ
bjmsr-366	43	21	cities	city	NOUN
bjmsr-366	43	22	and	and	CCONJ
bjmsr-366	43	23	towns	town	NOUN
bjmsr-366	43	24	.	.	PUNCT
bjmsr-366	44	1	efficient	efficient	ADJ
bjmsr-366	44	2	usage	usage	NOUN
bjmsr-366	44	3	of	of	ADP
bjmsr-366	44	4	routing	route	VERB
bjmsr-366	44	5	algorithms	algorithm	NOUN
bjmsr-366	44	6	can	can	AUX
bjmsr-366	44	7	significantly	significantly	ADV
bjmsr-366	44	8	reduce	reduce	VERB
bjmsr-366	44	9	travelling	travel	VERB
bjmsr-366	44	10	distance	distance	NOUN
bjmsr-366	44	11	and	and	CCONJ
bjmsr-366	44	12	transportation	transportation	NOUN
bjmsr-366	44	13	costs	cost	NOUN
bjmsr-366	44	14	as	as	ADV
bjmsr-366	44	15	well	well	ADV
bjmsr-366	44	16	.	.	PUNCT
bjmsr-366	45	1	usage	usage	NOUN
bjmsr-366	45	2	of	of	ADP
bjmsr-366	45	3	the	the	DET
bjmsr-366	45	4	shortest	short	ADJ
bjmsr-366	45	5	-	-	PUNCT
bjmsr-366	45	6	path	path	NOUN
bjmsr-366	45	7	algorithm	algorithm	NOUN
bjmsr-366	45	8	in	in	ADP
bjmsr-366	45	9	this	this	DET
bjmsr-366	45	10	case	case	NOUN
bjmsr-366	45	11	dijkstra	dijkstra	PROPN
bjmsr-366	45	12	's	's	PART
bjmsr-366	45	13	algorithm	algorithm	NOUN
bjmsr-366	45	14	for	for	ADP
bjmsr-366	45	15	inner	inner	ADJ
bjmsr-366	45	16	transportation	transportation	NOUN
bjmsr-366	45	17	optimization	optimization	NOUN
bjmsr-366	45	18	in	in	ADP
bjmsr-366	45	19	warehouses	warehouse	NOUN
bjmsr-366	45	20	.	.	PUNCT
bjmsr-366	46	1	the	the	DET
bjmsr-366	46	2	model	model	NOUN
bjmsr-366	46	3	integrates	integrate	VERB
bjmsr-366	46	4	data	datum	NOUN
bjmsr-366	46	5	such	such	ADJ
bjmsr-366	46	6	as	as	ADP
bjmsr-366	46	7	:	:	PUNCT
bjmsr-366	46	8	2d	2d	NUM
bjmsr-366	46	9	graph	graph	NOUN
bjmsr-366	46	10	of	of	ADP
bjmsr-366	46	11	warehouse	warehouse	NOUN
bjmsr-366	46	12	layout	layout	NOUN
bjmsr-366	46	13	,	,	PUNCT
bjmsr-366	46	14	its	its	PRON
bjmsr-366	46	15	3d	3d	PROPN
bjmsr-366	46	16	extension	extension	NOUN
bjmsr-366	46	17	,	,	PUNCT
bjmsr-366	46	18	historical	historical	ADJ
bjmsr-366	46	19	data	datum	NOUN
bjmsr-366	46	20	,	,	PUNCT
bjmsr-366	46	21	abc	abc	PROPN
bjmsr-366	46	22	analysis	analysis	NOUN
bjmsr-366	46	23	and	and	CCONJ
bjmsr-366	46	24	business	business	NOUN
bjmsr-366	46	25	process	process	NOUN
bjmsr-366	46	26	model	model	NOUN
bjmsr-366	46	27	.	.	PUNCT
bjmsr-366	47	1	the	the	DET
bjmsr-366	47	2	prototype	prototype	NOUN
bjmsr-366	47	3	of	of	ADP
bjmsr-366	47	4	proposed	propose	VERB
bjmsr-366	47	5	application	application	NOUN
bjmsr-366	47	6	is	be	AUX
bjmsr-366	47	7	tested	test	VERB
bjmsr-366	47	8	with	with	ADP
bjmsr-366	47	9	sample	sample	NOUN
bjmsr-366	47	10	data	datum	NOUN
bjmsr-366	47	11	and	and	CCONJ
bjmsr-366	47	12	by	by	ADP
bjmsr-366	47	13	simulating	simulate	VERB
bjmsr-366	47	14	different	different	ADJ
bjmsr-366	47	15	working	working	NOUN
bjmsr-366	47	16	conditions	condition	NOUN
bjmsr-366	47	17	.	.	PUNCT
bjmsr-366	48	1	3	3	X
bjmsr-366	48	2	.	.	X
bjmsr-366	48	3	graph	graph	NOUN
bjmsr-366	48	4	theory	theory	NOUN
bjmsr-366	48	5	a	a	DET
bjmsr-366	48	6	graph	graph	NOUN
bjmsr-366	48	7	g	g	NOUN
bjmsr-366	48	8	is	be	AUX
bjmsr-366	48	9	a	a	DET
bjmsr-366	48	10	collection	collection	NOUN
bjmsr-366	48	11	of	of	ADP
bjmsr-366	48	12	two	two	NUM
bjmsr-366	48	13	sets	set	NOUN
bjmsr-366	48	14	v	v	ADP
bjmsr-366	48	15	&	&	CCONJ
bjmsr-366	48	16	ewhere	ewhere	ADJ
bjmsr-366	48	17	v	v	NOUN
bjmsr-366	48	18	is	be	AUX
bjmsr-366	48	19	the	the	DET
bjmsr-366	48	20	collection	collection	NOUN
bjmsr-366	48	21	of	of	ADP
bjmsr-366	48	22	vertices	vertex	NOUN
bjmsr-366	48	23	v0,v1,	v0,v1,	PROPN
bjmsr-366	48	24	................	................	PUNCT
bjmsr-366	48	25	vn-1	vn-1	PUNCT
bjmsr-366	48	26	also	also	ADV
bjmsr-366	48	27	called	call	VERB
bjmsr-366	48	28	nodes	node	NOUN
bjmsr-366	48	29	and	and	CCONJ
bjmsr-366	48	30	e	e	NOUN
bjmsr-366	48	31	is	be	AUX
bjmsr-366	48	32	thecollection	thecollection	NOUN
bjmsr-366	48	33	of	of	ADP
bjmsr-366	48	34	edges	edge	NOUN
bjmsr-366	48	35	e1	e1	NOUN
bjmsr-366	48	36	,	,	PUNCT
bjmsr-366	48	37	e2,	e2,	NOUN
bjmsr-366	48	38	...............	...............	X
bjmsr-366	48	39	en	en	X
bjmsr-366	48	40	where	where	SCONJ
bjmsr-366	48	41	anedge	anedge	NOUN
bjmsr-366	48	42	is	be	AUX
bjmsr-366	48	43	an	an	DET
bjmsr-366	48	44	area	area	NOUN
bjmsr-366	48	45	which	which	PRON
bjmsr-366	48	46	connects	connect	VERB
bjmsr-366	48	47	two	two	NUM
bjmsr-366	48	48	nodes	node	NOUN
bjmsr-366	48	49	.	.	PUNCT
bjmsr-366	49	1	this	this	PRON
bjmsr-366	49	2	can	can	AUX
bjmsr-366	49	3	be	be	AUX
bjmsr-366	49	4	represented	represent	VERB
bjmsr-366	49	5	as	as	ADP
bjmsr-366	49	6	–	–	PUNCT
bjmsr-366	49	7	g=(v	g=(v	NOUN
bjmsr-366	49	8	,	,	PUNCT
bjmsr-366	49	9	e	e	NOUN
bjmsr-366	49	10	)	)	PUNCT
bjmsr-366	49	11	v(g)=(v0,v1,	v(g)=(v0,v1,	NOUN
bjmsr-366	49	12	.........	.........	SYM
bjmsr-366	49	13	vn)or	vn)or	NOUN
bjmsr-366	49	14	set	set	NOUN
bjmsr-366	49	15	of	of	ADP
bjmsr-366	49	16	vertices	vertex	NOUN
bjmsr-366	49	17	e(g)=(e1,e2,	e(g)=(e1,e2,	PROPN
bjmsr-366	49	18	..........	..........	PUNCT
bjmsr-366	49	19	en)or	en)or	NOUN
bjmsr-366	50	1	set	set	NOUN
bjmsr-366	50	2	of	of	ADP
bjmsr-366	50	3	edges	edge	NOUN
bjmsr-366	50	4	4	4	NUM
bjmsr-366	50	5	.	.	NOUN
bjmsr-366	50	6	overview	overview	NOUN
bjmsr-366	50	7	of	of	ADP
bjmsr-366	50	8	shortest	short	ADJ
bjmsr-366	50	9	path	path	NOUN
bjmsr-366	50	10	algorithm	algorithm	NOUN
bjmsr-366	50	11	there	there	PRON
bjmsr-366	50	12	are	be	VERB
bjmsr-366	50	13	several	several	ADJ
bjmsr-366	50	14	cases	case	NOUN
bjmsr-366	50	15	in	in	ADP
bjmsr-366	50	16	graph	graph	NOUN
bjmsr-366	50	17	where	where	SCONJ
bjmsr-366	50	18	we	we	PRON
bjmsr-366	50	19	have	have	VERB
bjmsr-366	50	20	a	a	DET
bjmsr-366	50	21	need	need	NOUN
bjmsr-366	50	22	to	to	PART
bjmsr-366	50	23	know	know	VERB
bjmsr-366	50	24	the	the	DET
bjmsr-366	50	25	shortest	short	ADJ
bjmsr-366	50	26	path	path	NOUN
bjmsr-366	50	27	from	from	ADP
bjmsr-366	50	28	one	one	NUM
bjmsr-366	50	29	node	node	NOUN
bjmsr-366	50	30	to	to	ADP
bjmsr-366	50	31	another	another	DET
bjmsr-366	50	32	node	node	NOUN
bjmsr-366	50	33	.	.	PUNCT
bjmsr-366	51	1	general	general	ADJ
bjmsr-366	51	2	electric	electric	PROPN
bjmsr-366	51	3	supply	supply	NOUN
bjmsr-366	51	4	system	system	NOUN
bjmsr-366	51	5	and	and	CCONJ
bjmsr-366	51	6	water	water	NOUN
bjmsr-366	51	7	distribution	distribution	NOUN
bjmsr-366	51	8	system	system	NOUN
bjmsr-366	51	9	also	also	ADV
bjmsr-366	51	10	follow	follow	VERB
bjmsr-366	51	11	this	this	DET
bjmsr-366	51	12	approach	approach	NOUN
bjmsr-366	51	13	.	.	PUNCT
bjmsr-366	52	1	the	the	DET
bjmsr-366	52	2	best	good	ADJ
bjmsr-366	52	3	example	example	NOUN
bjmsr-366	52	4	we	we	PRON
bjmsr-366	52	5	can	can	AUX
bjmsr-366	52	6	take	take	VERB
bjmsr-366	52	7	is	be	AUX
bjmsr-366	52	8	of	of	ADP
bjmsr-366	52	9	a	a	DET
bjmsr-366	52	10	railway	railway	NOUN
bjmsr-366	52	11	track	track	NOUN
bjmsr-366	52	12	system	system	NOUN
bjmsr-366	52	13	.	.	PUNCT
bjmsr-366	53	1	suppose	suppose	VERB
bjmsr-366	53	2	one	one	NUM
bjmsr-366	53	3	person	person	NOUN
bjmsr-366	53	4	wants	want	VERB
bjmsr-366	53	5	to	to	PART
bjmsr-366	53	6	go	go	VERB
bjmsr-366	53	7	from	from	ADP
bjmsr-366	53	8	one	one	NUM
bjmsr-366	53	9	station	station	NOUN
bjmsr-366	53	10	to	to	ADP
bjmsr-366	53	11	another	another	PRON
bjmsr-366	53	12	then	then	ADV
bjmsr-366	53	13	he	he	PRON
bjmsr-366	53	14	needs	need	VERB
bjmsr-366	53	15	to	to	PART
bjmsr-366	53	16	know	know	VERB
bjmsr-366	53	17	the	the	DET
bjmsr-366	53	18	shortest	short	ADJ
bjmsr-366	53	19	path	path	NOUN
bjmsr-366	53	20	from	from	ADP
bjmsr-366	53	21	one	one	NUM
bjmsr-366	53	22	station	station	NOUN
bjmsr-366	53	23	to	to	ADP
bjmsr-366	53	24	another	another	DET
bjmsr-366	53	25	here	here	ADJ
bjmsr-366	53	26	station	station	NOUN
bjmsr-366	53	27	to	to	ADP
bjmsr-366	53	28	another	another	PRON
bjmsr-366	53	29	.	.	PUNCT
bjmsr-366	54	1	here	here	ADV
bjmsr-366	54	2	station	station	NOUN
bjmsr-366	54	3	represents	represent	VERB
bjmsr-366	54	4	the	the	DET
bjmsr-366	54	5	node	node	NOUN
bjmsr-366	54	6	and	and	CCONJ
bjmsr-366	54	7	tracks	track	NOUN
bjmsr-366	54	8	represent	represent	VERB
bjmsr-366	54	9	edges	edge	NOUN
bjmsr-366	54	10	.	.	PUNCT
bjmsr-366	55	1	in	in	ADP
bjmsr-366	55	2	computers	computer	NOUN
bjmsr-366	55	3	,	,	PUNCT
bjmsr-366	55	4	it	it	PRON
bjmsr-366	55	5	is	be	AUX
bjmsr-366	55	6	very	very	ADV
bjmsr-366	55	7	useful	useful	ADJ
bjmsr-366	55	8	in	in	ADP
bjmsr-366	55	9	network	network	NOUN
bjmsr-366	55	10	for	for	ADP
bjmsr-366	55	11	routing	routing	NOUN
bjmsr-366	55	12	concepts	concept	NOUN
bjmsr-366	55	13	.	.	PUNCT
bjmsr-366	56	1	there	there	PRON
bjmsr-366	56	2	can	can	AUX
bjmsr-366	56	3	be	be	AUX
bjmsr-366	56	4	several	several	ADJ
bjmsr-366	56	5	paths	path	NOUN
bjmsr-366	56	6	for	for	ADP
bjmsr-366	56	7	going	go	VERB
bjmsr-366	56	8	from	from	ADP
bjmsr-366	56	9	one	one	NUM
bjmsr-366	56	10	to	to	ADP
bjmsr-366	56	11	another	another	DET
bjmsr-366	56	12	node	node	NOUN
bjmsr-366	56	13	.	.	PUNCT
bjmsr-366	57	1	but	but	CCONJ
bjmsr-366	57	2	the	the	DET
bjmsr-366	57	3	shortest	short	ADJ
bjmsr-366	57	4	path	path	NOUN
bjmsr-366	57	5	is	be	AUX
bjmsr-366	57	6	that	that	DET
bjmsr-366	57	7	path	path	NOUN
bjmsr-366	57	8	in	in	ADP
bjmsr-366	57	9	which	which	PRON
bjmsr-366	57	10	the	the	DET
bjmsr-366	57	11	sum	sum	NOUN
bjmsr-366	57	12	of	of	ADP
bjmsr-366	57	13	weights	weight	NOUN
bjmsr-366	57	14	o	o	PROPN
bjmsr-366	57	15	the	the	DET
bjmsr-366	57	16	included	include	VERB
bjmsr-366	57	17	edges	edge	NOUN
bjmsr-366	57	18	is	be	AUX
bjmsr-366	57	19	the	the	DET
bjmsr-366	57	20	minimum	minimum	NOUN
bjmsr-366	57	21	.	.	PUNCT
bjmsr-366	58	1	4.1	4.1	NUM
bjmsr-366	58	2	dijkstra	dijkstra	PROPN
bjmsr-366	58	3	’s	’s	PART
bjmsr-366	58	4	algorithm	algorithm	NOUN
bjmsr-366	58	5	let	let	VERB
bjmsr-366	58	6	the	the	DET
bjmsr-366	58	7	node	node	NOUN
bjmsr-366	58	8	at	at	ADP
bjmsr-366	58	9	which	which	PRON
bjmsr-366	58	10	we	we	PRON
bjmsr-366	58	11	are	be	AUX
bjmsr-366	58	12	starting	start	VERB
bjmsr-366	58	13	be	be	AUX
bjmsr-366	58	14	called	call	VERB
bjmsr-366	58	15	the	the	DET
bjmsr-366	58	16	initial	initial	ADJ
bjmsr-366	58	17	node	node	NOUN
bjmsr-366	58	18	.	.	PUNCT
bjmsr-366	59	1	dijkstra	dijkstra	PROPN
bjmsr-366	59	2	's	's	PART
bjmsr-366	59	3	algorithm	algorithm	NOUN
bjmsr-366	59	4	will	will	AUX
bjmsr-366	59	5	assign	assign	VERB
bjmsr-366	59	6	some	some	DET
bjmsr-366	59	7	initial	initial	ADJ
bjmsr-366	59	8	distance	distance	NOUN
bjmsr-366	59	9	values	value	NOUN
bjmsr-366	59	10	and	and	CCONJ
bjmsr-366	59	11	will	will	AUX
bjmsr-366	59	12	try	try	VERB
bjmsr-366	59	13	to	to	PART
bjmsr-366	59	14	improve	improve	VERB
bjmsr-366	59	15	them	they	PRON
bjmsr-366	59	16	step	step	NOUN
bjmsr-366	59	17	by	by	ADP
bjmsr-366	59	18	step	step	NOUN
bjmsr-366	59	19	.	.	PUNCT
bjmsr-366	60	1	for	for	ADP
bjmsr-366	60	2	the	the	DET
bjmsr-366	60	3	first	first	ADJ
bjmsr-366	60	4	iteration	iteration	NOUN
bjmsr-366	60	5	,	,	PUNCT
bjmsr-366	60	6	the	the	DET
bjmsr-366	60	7	current	current	ADJ
bjmsr-366	60	8	intersection	intersection	NOUN
bjmsr-366	60	9	will	will	AUX
bjmsr-366	60	10	be	be	AUX
bjmsr-366	60	11	the	the	DET
bjmsr-366	60	12	starting	starting	NOUN
bjmsr-366	60	13	point	point	NOUN
bjmsr-366	60	14	and	and	CCONJ
bjmsr-366	60	15	the	the	DET
bjmsr-366	60	16	distance	distance	NOUN
bjmsr-366	60	17	to	to	ADP
bjmsr-366	60	18	it	it	PRON
bjmsr-366	60	19	will	will	AUX
bjmsr-366	60	20	be	be	AUX
bjmsr-366	60	21	zero	zero	NUM
bjmsr-366	60	22	.	.	PUNCT
bjmsr-366	61	1	for	for	ADP
bjmsr-366	61	2	subsequent	subsequent	ADJ
bjmsr-366	61	3	iterations	iteration	NOUN
bjmsr-366	61	4	(	(	PUNCT
bjmsr-366	61	5	after	after	ADP
bjmsr-366	61	6	the	the	DET
bjmsr-366	61	7	first	first	ADJ
bjmsr-366	61	8	)	)	PUNCT
bjmsr-366	61	9	,	,	PUNCT
bjmsr-366	61	10	the	the	DET
bjmsr-366	61	11	current	current	ADJ
bjmsr-366	61	12	intersection	intersection	NOUN
bjmsr-366	61	13	will	will	AUX
bjmsr-366	61	14	be	be	AUX
bjmsr-366	61	15	the	the	DET
bjmsr-366	61	16	closest	close	ADV
bjmsr-366	61	17	unvisited	unvisited	ADJ
bjmsr-366	61	18	intersection	intersection	NOUN
bjmsr-366	61	19	to	to	ADP
bjmsr-366	61	20	the	the	DET
bjmsr-366	61	21	starting	starting	NOUN
bjmsr-366	61	22	point	point	NOUN
bjmsr-366	61	23	—	—	PUNCT
bjmsr-366	61	24	this	this	PRON
bjmsr-366	61	25	will	will	AUX
bjmsr-366	61	26	be	be	AUX
bjmsr-366	61	27	easy	easy	ADJ
bjmsr-366	61	28	to	to	ADP
bjmsr-366	61	29	find.from	find.from	ADP
bjmsr-366	61	30	the	the	DET
bjmsr-366	61	31	current	current	ADJ
bjmsr-366	61	32	intersection	intersection	NOUN
bjmsr-366	61	33	,	,	PUNCT
bjmsr-366	61	34	update	update	VERB
bjmsr-366	61	35	the	the	DET
bjmsr-366	61	36	distance	distance	NOUN
bjmsr-366	61	37	to	to	ADP
bjmsr-366	61	38	every	every	DET
bjmsr-366	61	39	unvisited	unvisited	ADJ
bjmsr-366	61	40	intersection	intersection	NOUN
bjmsr-366	61	41	that	that	PRON
bjmsr-366	61	42	is	be	AUX
bjmsr-366	61	43	directly	directly	ADV
bjmsr-366	61	44	connected	connect	VERB
bjmsr-366	61	45	to	to	ADP
bjmsr-366	61	46	it	it	PRON
bjmsr-366	61	47	.	.	PUNCT
bjmsr-366	62	1	this	this	PRON
bjmsr-366	62	2	is	be	AUX
bjmsr-366	62	3	done	do	VERB
bjmsr-366	62	4	by	by	ADP
bjmsr-366	62	5	determining	determine	VERB
bjmsr-366	62	6	the	the	DET
bjmsr-366	62	7	sum	sum	NOUN
bjmsr-366	62	8	of	of	ADP
bjmsr-366	62	9	the	the	DET
bjmsr-366	62	10	distance	distance	NOUN
bjmsr-366	62	11	between	between	ADP
bjmsr-366	62	12	an	an	DET
bjmsr-366	62	13	unvisited	unvisited	ADJ
bjmsr-366	62	14	intersection	intersection	NOUN
bjmsr-366	62	15	and	and	CCONJ
bjmsr-366	62	16	the	the	DET
bjmsr-366	62	17	value	value	NOUN
bjmsr-366	62	18	of	of	ADP
bjmsr-366	62	19	the	the	DET
bjmsr-366	62	20	current	current	ADJ
bjmsr-366	62	21	inters	inter	NOUN
bjmsr-366	62	22	section	section	NOUN
bjmsr-366	62	23	and	and	CCONJ
bjmsr-366	62	24	relabeling	relabele	VERB
bjmsr-366	62	25	the	the	DET
bjmsr-366	62	26	unvisited	unvisited	ADJ
bjmsr-366	62	27	intersection	intersection	NOUN
bjmsr-366	62	28	with	with	ADP
bjmsr-366	62	29	this	this	DET
bjmsr-366	62	30	value	value	NOUN
bjmsr-366	62	31	if	if	SCONJ
bjmsr-366	62	32	it	it	PRON
bjmsr-366	62	33	is	be	AUX
bjmsr-366	62	34	less	less	ADJ
bjmsr-366	62	35	than	than	ADP
bjmsr-366	62	36	its	its	PRON
bjmsr-366	62	37	current	current	ADJ
bjmsr-366	62	38	value	value	NOUN
bjmsr-366	62	39	.	.	PUNCT
bjmsr-366	63	1	in	in	ADP
bjmsr-366	63	2	effect	effect	NOUN
bjmsr-366	63	3	,	,	PUNCT
bjmsr-366	63	4	the	the	DET
bjmsr-366	63	5	intersection	intersection	NOUN
bjmsr-366	63	6	is	be	AUX
bjmsr-366	63	7	relabelled	relabelle	VERB
bjmsr-366	63	8	if	if	SCONJ
bjmsr-366	63	9	the	the	DET
bjmsr-366	63	10	path	path	NOUN
bjmsr-366	63	11	to	to	ADP
bjmsr-366	63	12	it	it	PRON
bjmsr-366	63	13	through	through	ADP
bjmsr-366	63	14	the	the	DET
bjmsr-366	63	15	current	current	ADJ
bjmsr-366	63	16	intersection	intersection	NOUN
bjmsr-366	63	17	is	be	AUX
bjmsr-366	63	18	shorter	short	ADJ
bjmsr-366	63	19	than	than	ADP
bjmsr-366	63	20	the	the	DET
bjmsr-366	63	21	previously	previously	ADV
bjmsr-366	63	22	known	know	VERB
bjmsr-366	63	23	paths	path	NOUN
bjmsr-366	63	24	.	.	PUNCT
bjmsr-366	64	1	to	to	PART
bjmsr-366	64	2	facilitate	facilitate	VERB
bjmsr-366	64	3	shortest	short	ADJ
bjmsr-366	64	4	path	path	NOUN
bjmsr-366	64	5	identification	identification	NOUN
bjmsr-366	64	6	,	,	PUNCT
bjmsr-366	64	7	in	in	ADP
bjmsr-366	64	8	pencil	pencil	NOUN
bjmsr-366	64	9	,	,	PUNCT
bjmsr-366	64	10	mark	mark	VERB
bjmsr-366	64	11	the	the	DET
bjmsr-366	64	12	road	road	NOUN
bjmsr-366	64	13	with	with	ADP
bjmsr-366	64	14	an	an	DET
bjmsr-366	64	15	arrow	arrow	NOUN
bjmsr-366	64	16	pointing	pointing	NOUN
bjmsr-366	64	17	to	to	ADP
bjmsr-366	64	18	the	the	DET
bjmsr-366	64	19	relabeled	relabele	VERB
bjmsr-366	64	20	intersection	intersection	NOUN
bjmsr-366	64	21	if	if	SCONJ
bjmsr-366	64	22	you	you	PRON
bjmsr-366	64	23	label	label	VERB
bjmsr-366	64	24	/	/	SYM
bjmsr-366	64	25	relabel	relabel	NOUN
bjmsr-366	64	26	it	it	PRON
bjmsr-366	64	27	,	,	PUNCT
bjmsr-366	64	28	and	and	CCONJ
bjmsr-366	64	29	erase	erase	VERB
bjmsr-366	64	30	all	all	DET
bjmsr-366	64	31	others	other	NOUN
bjmsr-366	64	32	pointing	point	VERB
bjmsr-366	64	33	to	to	ADP
bjmsr-366	64	34	it	it	PRON
bjmsr-366	64	35	.	.	PUNCT
bjmsr-366	65	1	after	after	SCONJ
bjmsr-366	65	2	you	you	PRON
bjmsr-366	65	3	have	have	AUX
bjmsr-366	65	4	updated	update	VERB
bjmsr-366	65	5	the	the	DET
bjmsr-366	65	6	distances	distance	NOUN
bjmsr-366	65	7	to	to	ADP
bjmsr-366	65	8	each	each	DET
bjmsr-366	65	9	neighbouring	neighbouring	NOUN
bjmsr-366	65	10	intersection	intersection	NOUN
bjmsr-366	65	11	,	,	PUNCT
bjmsr-366	65	12	mark	mark	VERB
bjmsr-366	65	13	the	the	DET
bjmsr-366	65	14	current	current	ADJ
bjmsr-366	65	15	intersection	intersection	NOUN
bjmsr-366	65	16	as	as	SCONJ
bjmsr-366	65	17	visited	visit	VERB
bjmsr-366	65	18	and	and	CCONJ
bjmsr-366	65	19	select	select	VERB
bjmsr-366	65	20	the	the	DET
bjmsr-366	65	21	unvisited	unvisited	ADJ
bjmsr-366	65	22	intersection	intersection	NOUN
bjmsr-366	65	23	with	with	ADP
bjmsr-366	65	24	lowest	low	ADJ
bjmsr-366	65	25	distance	distance	NOUN
bjmsr-366	65	26	(	(	PUNCT
bjmsr-366	65	27	from	from	ADP
bjmsr-366	65	28	the	the	DET
bjmsr-366	65	29	starting	starting	NOUN
bjmsr-366	65	30	point	point	NOUN
bjmsr-366	65	31	)	)	PUNCT
bjmsr-366	65	32	–	–	PUNCT
bjmsr-366	65	33	or	or	CCONJ
bjmsr-366	65	34	the	the	DET
bjmsr-366	65	35	lowest	low	ADJ
bjmsr-366	65	36	label	label	NOUN
bjmsr-366	65	37	—	—	PUNCT
bjmsr-366	65	38	as	as	ADP
bjmsr-366	65	39	the	the	DET
bjmsr-366	65	40	current	current	ADJ
bjmsr-366	65	41	intersection	intersection	NOUN
bjmsr-366	65	42	.	.	PUNCT
bjmsr-366	66	1	nodes	node	NOUN
bjmsr-366	66	2	marked	mark	VERB
bjmsr-366	66	3	as	as	SCONJ
bjmsr-366	66	4	visited	visit	VERB
bjmsr-366	66	5	are	be	AUX
bjmsr-366	66	6	labelled	label	VERB
bjmsr-366	66	7	with	with	ADP
bjmsr-366	66	8	the	the	DET
bjmsr-366	66	9	shortest	short	ADJ
bjmsr-366	66	10	path	path	NOUN
bjmsr-366	66	11	from	from	ADP
bjmsr-366	66	12	the	the	DET
bjmsr-366	66	13	starting	starting	NOUN
bjmsr-366	66	14	point	point	NOUN
bjmsr-366	66	15	to	to	ADP
bjmsr-366	66	16	it	it	PRON
bjmsr-366	66	17	and	and	CCONJ
bjmsr-366	66	18	will	will	AUX
bjmsr-366	66	19	not	not	PART
bjmsr-366	66	20	be	be	AUX
bjmsr-366	66	21	revisited	revisit	VERB
bjmsr-366	66	22	or	or	CCONJ
bjmsr-366	66	23	returned	return	VERB
bjmsr-366	66	24	to	to	ADP
bjmsr-366	66	25	.	.	PUNCT
bjmsr-366	67	1	copyright	copyright	NOUN
bjmsr-366	67	2	©	©	PROPN
bjmsr-366	67	3	cc	cc	PROPN
bjmsr-366	67	4	-	-	PUNCT
bjmsr-366	67	5	by	by	ADP
bjmsr-366	67	6	-	-	PUNCT
bjmsr-366	67	7	nc	nc	PROPN
bjmsr-366	67	8	2019	2019	NUM
bjmsr-366	67	9	,	,	PUNCT
bjmsr-366	67	10	bjmsr	bjmsr	PROPN
bjmsr-366	67	11	www.cribfb.com/journal/index.php/bjmsr	www.cribfb.com/journal/index.php/bjmsr	X
bjmsr-366	67	12	bangladesh	bangladesh	PROPN
bjmsr-366	67	13	journal	journal	PROPN
bjmsr-366	67	14	of	of	ADP
bjmsr-366	67	15	multidisciplinary	multidisciplinary	ADJ
bjmsr-366	67	16	scientific	scientific	ADJ
bjmsr-366	67	17	research	research	NOUN
bjmsr-366	67	18	vol	vol	NOUN
bjmsr-366	67	19	.	.	PROPN
bjmsr-366	68	1	1	1	NUM
bjmsr-366	68	2	,	,	PUNCT
bjmsr-366	68	3	no	no	INTJ
bjmsr-366	68	4	.	.	NOUN
bjmsr-366	68	5	2	2	NUM
bjmsr-366	68	6	;	;	PUNCT
bjmsr-366	68	7	2019	2019	NUM
bjmsr-366	68	8	43	43	NUM
bjmsr-366	68	9	4.2	4.2	NUM
bjmsr-366	68	10	algorithm	algorithm	NOUN
bjmsr-366	68	11	//	//	NOUN
bjmsr-366	68	12	direction	direction	NOUN
bjmsr-366	68	13	line	line	NOUN
bjmsr-366	68	14	between	between	ADP
bjmsr-366	68	15	p1	p1	PROPN
bjmsr-366	68	16	and	and	CCONJ
bjmsr-366	68	17	p2	p2	PROPN
bjmsr-366	68	18	dx	dx	PROPN
bjmsr-366	68	19	=	=	SYM
bjmsr-366	68	20	node[p2].x	node[p2].x	NOUN
bjmsr-366	68	21	-	-	PUNCT
bjmsr-366	68	22	node[p1].x	node[p1].x	NOUN
bjmsr-366	68	23	;	;	PUNCT
bjmsr-366	68	24	dy	dy	NOUN
bjmsr-366	68	25	=	=	SYM
bjmsr-366	68	26	node[p2].y	node[p2].y	PROPN
bjmsr-366	68	27	-	-	PUNCT
bjmsr-366	68	28	node[p1].y	node[p1].y	NOUN
bjmsr-366	68	29	;	;	PUNCT
bjmsr-366	68	30	//	//	NUM
bjmsr-366	68	31	distance	distance	NOUN
bjmsr-366	68	32	between	between	ADP
bjmsr-366	68	33	p1	p1	NOUN
bjmsr-366	68	34	and	and	CCONJ
bjmsr-366	68	35	p2	p2	PROPN
bjmsr-366	68	36	l	l	NOUN
bjmsr-366	69	1	=	=	PUNCT
bjmsr-366	69	2	(	(	PUNCT
bjmsr-366	69	3	float)(math.sqrt((float)(dx*dx	float)(math.sqrt((float)(dx*dx	PROPN
bjmsr-366	69	4	+	+	CCONJ
bjmsr-366	69	5	dy*dy	dy*dy	NOUN
bjmsr-366	69	6	)	)	PUNCT
bjmsr-366	69	7	)	)	PUNCT
bjmsr-366	69	8	)	)	PUNCT
bjmsr-366	69	9	;	;	PUNCT
bjmsr-366	69	10	dir_x[p1][p2]=dx	dir_x[p1][p2]=dx	X
bjmsr-366	69	11	/	/	SYM
bjmsr-366	69	12	l	l	NOUN
bjmsr-366	69	13	;	;	PUNCT
bjmsr-366	69	14	dir_y[p1][p2]=dy	dir_y[p1][p2]=dy	ADJ
bjmsr-366	69	15	/	/	SYM
bjmsr-366	69	16	l	l	NOUN
bjmsr-366	69	17	;	;	PUNCT
bjmsr-366	69	18	//	//	X
bjmsr-366	69	19	calculate	calculate	VERB
bjmsr-366	69	20	the	the	DET
bjmsr-366	69	21	start	start	NOUN
bjmsr-366	69	22	and	and	CCONJ
bjmsr-366	69	23	endpoints	endpoint	NOUN
bjmsr-366	69	24	of	of	ADP
bjmsr-366	69	25	the	the	DET
bjmsr-366	69	26	arrow	arrow	NOUN
bjmsr-366	69	27	,	,	PUNCT
bjmsr-366	69	28	//	//	PUNCT
bjmsr-366	69	29	adjust	adjust	VERB
bjmsr-366	69	30	startpoints	startpoint	NOUN
bjmsr-366	69	31	if	if	SCONJ
bjmsr-366	69	32	there	there	PRON
bjmsr-366	69	33	also	also	ADV
bjmsr-366	69	34	is	be	AUX
bjmsr-366	69	35	an	an	DET
bjmsr-366	69	36	arrow	arrow	NOUN
bjmsr-366	69	37	from	from	ADP
bjmsr-366	69	38	p2	p2	PROPN
bjmsr-366	69	39	to	to	ADP
bjmsr-366	69	40	p1	p1	VERB
bjmsr-366	69	41	if	if	SCONJ
bjmsr-366	69	42	(	(	PUNCT
bjmsr-366	69	43	weight[p2][p1]>0	weight[p2][p1]>0	NOUN
bjmsr-366	69	44	)	)	PUNCT
bjmsr-366	69	45	{	{	PUNCT
bjmsr-366	69	46	startp[p1][p2	startp[p1][p2	PROPN
bjmsr-366	69	47	]	]	X
bjmsr-366	69	48	=	=	SYM
bjmsr-366	69	49	new	new	ADJ
bjmsr-366	69	50	point((int)(node[p1].x-5*dir_y[p1][p2	point((int)(node[p1].x-5*dir_y[p1][p2	PROPN
bjmsr-366	69	51	]	]	PUNCT
bjmsr-366	69	52	)	)	PUNCT
bjmsr-366	69	53	,	,	PUNCT
bjmsr-366	69	54	(	(	PUNCT
bjmsr-366	69	55	int)(node[p1].y+5*dir_x[p1][p2	int)(node[p1].y+5*dir_x[p1][p2	NOUN
bjmsr-366	69	56	]	]	X
bjmsr-366	69	57	)	)	PUNCT
bjmsr-366	69	58	)	)	PUNCT
bjmsr-366	69	59	;	;	PUNCT
bjmsr-366	69	60	endp[p1][p2	endp[p1][p2	PROPN
bjmsr-366	69	61	]	]	PUNCT
bjmsr-366	69	62	=	=	SYM
bjmsr-366	69	63	new	new	ADJ
bjmsr-366	69	64	point((int)(node[p2].x-5*dir_y[p1][p2	point((int)(node[p2].x-5*dir_y[p1][p2	NOUN
bjmsr-366	69	65	]	]	PUNCT
bjmsr-366	69	66	)	)	PUNCT
bjmsr-366	69	67	,	,	PUNCT
bjmsr-366	69	68	(	(	PUNCT
bjmsr-366	69	69	int)(node[p2].y+5*dir_x[p1][p2	int)(node[p2].y+5*dir_x[p1][p2	NOUN
bjmsr-366	69	70	]	]	PUNCT
bjmsr-366	69	71	)	)	PUNCT
bjmsr-366	69	72	)	)	PUNCT
bjmsr-366	69	73	;	;	PUNCT
bjmsr-366	69	74	}	}	PUNCT
bjmsr-366	69	75	else	else	ADV
bjmsr-366	69	76	{	{	PUNCT
bjmsr-366	69	77	startp[p1][p2	startp[p1][p2	NOUN
bjmsr-366	69	78	]	]	PUNCT
bjmsr-366	69	79	=	=	SYM
bjmsr-366	69	80	new	new	ADJ
bjmsr-366	69	81	point(node[p1].x	point(node[p1].x	PROPN
bjmsr-366	69	82	,	,	PUNCT
bjmsr-366	69	83	node[p1].y	node[p1].y	PROPN
bjmsr-366	69	84	)	)	PUNCT
bjmsr-366	69	85	;	;	PUNCT
bjmsr-366	69	86	endp[p1][p2	endp[p1][p2	PROPN
bjmsr-366	69	87	]	]	PUNCT
bjmsr-366	70	1	=	=	SYM
bjmsr-366	70	2	new	new	ADJ
bjmsr-366	70	3	point(node[p2].x	point(node[p2].x	PROPN
bjmsr-366	70	4	,	,	PUNCT
bjmsr-366	70	5	node[p2].y	node[p2].y	PROPN
bjmsr-366	70	6	)	)	PUNCT
bjmsr-366	70	7	;	;	PUNCT
bjmsr-366	70	8	}	}	PUNCT
bjmsr-366	70	9	//	//	X
bjmsr-366	70	10	range	range	NOUN
bjmsr-366	70	11	for	for	ADP
bjmsr-366	70	12	arrowhead	arrowhead	NOUN
bjmsr-366	70	13	is	be	AUX
bjmsr-366	70	14	not	not	PART
bjmsr-366	70	15	all	all	DET
bjmsr-366	70	16	the	the	DET
bjmsr-366	70	17	way	way	NOUN
bjmsr-366	70	18	to	to	ADP
bjmsr-366	70	19	the	the	DET
bjmsr-366	70	20	start	start	NOUN
bjmsr-366	70	21	/	/	SYM
bjmsr-366	70	22	endpoints	endpoint	NOUN
bjmsr-366	70	23	intdiff_x	intdiff_x	ADJ
bjmsr-366	70	24	=	=	SYM
bjmsr-366	70	25	(	(	PUNCT
bjmsr-366	70	26	int)(math.abs(20*dir_x[p1][p2	int)(math.abs(20*dir_x[p1][p2	PROPN
bjmsr-366	70	27	]	]	NOUN
bjmsr-366	70	28	)	)	PUNCT
bjmsr-366	70	29	)	)	PUNCT
bjmsr-366	70	30	;	;	PUNCT
bjmsr-366	71	1	intdiff_y	intdiff_y	X
bjmsr-366	71	2	=	=	SYM
bjmsr-366	71	3	(	(	PUNCT
bjmsr-366	71	4	int)(math.abs(20*dir_y[p1][p2	int)(math.abs(20*dir_y[p1][p2	PROPN
bjmsr-366	71	5	]	]	X
bjmsr-366	71	6	)	)	PUNCT
bjmsr-366	71	7	)	)	PUNCT
bjmsr-366	71	8	;	;	PUNCT
bjmsr-366	71	9	//	//	NUM
bjmsr-366	71	10	calculate	calculate	VERB
bjmsr-366	71	11	new	new	ADJ
bjmsr-366	71	12	x	x	ADJ
bjmsr-366	71	13	-	-	NOUN
bjmsr-366	71	14	position	position	NOUN
bjmsr-366	71	15	arrowhead	arrowhead	NOUN
bjmsr-366	71	16	if	if	SCONJ
bjmsr-366	71	17	(	(	PUNCT
bjmsr-366	71	18	startp[p1][p2].x	startp[p1][p2].x	NOUN
bjmsr-366	71	19	>	>	PUNCT
bjmsr-366	71	20	endp[p1][p2].x	endp[p1][p2].x	PUNCT
bjmsr-366	71	21	)	)	PUNCT
bjmsr-366	71	22	{	{	PUNCT
bjmsr-366	71	23	arrow[p1][p2	arrow[p1][p2	PROPN
bjmsr-366	71	24	]	]	PUNCT
bjmsr-366	71	25	=	=	SYM
bjmsr-366	71	26	new	new	ADJ
bjmsr-366	71	27	point(endp[p1][p2].x	point(endp[p1][p2].x	NOUN
bjmsr-366	71	28	+	+	CCONJ
bjmsr-366	71	29	diff_x	diff_x	ADJ
bjmsr-366	71	30	+	+	CCONJ
bjmsr-366	71	31	(	(	PUNCT
bjmsr-366	71	32	math.abs(endp[p1][p2].xstartp[p1][p2].x	math.abs(endp[p1][p2].xstartp[p1][p2].x	PROPN
bjmsr-366	71	33	)	)	PUNCT
bjmsr-366	71	34	2*diff_x	2*diff_x	NOUN
bjmsr-366	71	35	)	)	PUNCT
bjmsr-366	71	36	*	*	PUNCT
bjmsr-366	72	1	(	(	PUNCT
bjmsr-366	72	2	100	100	NUM
bjmsr-366	72	3	-	-	PUNCT
bjmsr-366	72	4	w)/100	w)/100	NOUN
bjmsr-366	72	5	,	,	PUNCT
bjmsr-366	72	6	0	0	NUM
bjmsr-366	72	7	)	)	PUNCT
bjmsr-366	72	8	;	;	PUNCT
bjmsr-366	72	9	}	}	PUNCT
bjmsr-366	72	10	else	else	ADV
bjmsr-366	72	11	{	{	PUNCT
bjmsr-366	72	12	arrow[p1][p2	arrow[p1][p2	PROPN
bjmsr-366	72	13	]	]	PUNCT
bjmsr-366	73	1	=	=	SYM
bjmsr-366	73	2	new	new	ADJ
bjmsr-366	73	3	point(startp[p1][p2].x	point(startp[p1][p2].x	NOUN
bjmsr-366	73	4	+	+	CCONJ
bjmsr-366	73	5	diff_x	diff_x	ADJ
bjmsr-366	73	6	+	+	CCONJ
bjmsr-366	73	7	(	(	PUNCT
bjmsr-366	73	8	math.abs(endp[p1][p2].x	math.abs(endp[p1][p2].x	NOUN
bjmsr-366	73	9	-	-	PUNCT
bjmsr-366	73	10	startp[p1][p2].x	startp[p1][p2].x	NOUN
bjmsr-366	73	11	)	)	PUNCT
bjmsr-366	73	12	2*diff_x	2*diff_x	X
bjmsr-366	73	13	)	)	PUNCT
bjmsr-366	73	14	*	*	PUNCT
bjmsr-366	73	15	w/100	w/100	PROPN
bjmsr-366	73	16	,	,	PUNCT
bjmsr-366	73	17	0	0	NUM
bjmsr-366	73	18	)	)	PUNCT
bjmsr-366	73	19	;	;	PUNCT
bjmsr-366	73	20	}	}	PUNCT
bjmsr-366	73	21	//	//	PUNCT
bjmsr-366	73	22	calculate	calculate	VERB
bjmsr-366	73	23	new	new	ADJ
bjmsr-366	73	24	y	y	NOUN
bjmsr-366	73	25	-	-	PUNCT
bjmsr-366	73	26	position	position	NOUN
bjmsr-366	73	27	arrowhead	arrowhead	NOUN
bjmsr-366	74	1	if	if	SCONJ
bjmsr-366	74	2	(	(	PUNCT
bjmsr-366	74	3	startp[p1][p2].y	startp[p1][p2].y	NOUN
bjmsr-366	74	4	>	>	X
bjmsr-366	74	5	endp[p1][p2].y	endp[p1][p2].y	PRON
bjmsr-366	74	6	)	)	PUNCT
bjmsr-366	74	7	{	{	PUNCT
bjmsr-366	74	8	arrow[p1][p2].y	arrow[p1][p2].y	NOUN
bjmsr-366	74	9	=	=	SYM
bjmsr-366	74	10	endp[p1][p2].y	endp[p1][p2].y	X
bjmsr-366	74	11	+	+	X
bjmsr-366	74	12	diff_y	diff_y	X
bjmsr-366	74	13	+	+	CCONJ
bjmsr-366	74	14	(	(	PUNCT
bjmsr-366	74	15	math.abs(endp[p1][p2].y	math.abs(endp[p1][p2].y	X
bjmsr-366	74	16	-	-	PUNCT
bjmsr-366	74	17	startp[p1][p2].y	startp[p1][p2].y	NOUN
bjmsr-366	74	18	)	)	PUNCT
bjmsr-366	74	19	2*diff_y	2*diff_y	NOUN
bjmsr-366	74	20	)	)	PUNCT
bjmsr-366	75	1	*	*	PUNCT
bjmsr-366	75	2	(	(	PUNCT
bjmsr-366	75	3	100	100	NUM
bjmsr-366	75	4	-	-	PUNCT
bjmsr-366	75	5	w)/100	w)/100	NOUN
bjmsr-366	75	6	;	;	PUNCT
bjmsr-366	75	7	}	}	PUNCT
bjmsr-366	75	8	else	else	ADV
bjmsr-366	75	9	{	{	PUNCT
bjmsr-366	75	10	arrow[p1][p2].y	arrow[p1][p2].y	NOUN
bjmsr-366	75	11	=	=	NOUN
bjmsr-366	75	12	startp[p1][p2].y	startp[p1][p2].y	NOUN
bjmsr-366	75	13	+	+	CCONJ
bjmsr-366	75	14	diff_y	diff_y	X
bjmsr-366	75	15	+	+	CCONJ
bjmsr-366	75	16	(	(	PUNCT
bjmsr-366	75	17	math.abs(endp[p1][p2].y	math.abs(endp[p1][p2].y	X
bjmsr-366	75	18	-	-	PUNCT
bjmsr-366	75	19	startp[p1][p2].y	startp[p1][p2].y	NOUN
bjmsr-366	75	20	)	)	PUNCT
bjmsr-366	75	21	2*diff_y	2*diff_y	NOUN
bjmsr-366	75	22	)	)	PUNCT
bjmsr-366	75	23	*	*	PUNCT
bjmsr-366	75	24	w/100	w/100	PROPN
bjmsr-366	75	25	;	;	PUNCT
bjmsr-366	75	26	5	5	X
bjmsr-366	75	27	.	.	X
bjmsr-366	75	28	experimental	experimental	ADJ
bjmsr-366	75	29	results	result	NOUN
bjmsr-366	75	30	in	in	ADP
bjmsr-366	75	31	this	this	DET
bjmsr-366	75	32	section	section	NOUN
bjmsr-366	75	33	,	,	PUNCT
bjmsr-366	75	34	we	we	PRON
bjmsr-366	75	35	conduct	conduct	VERB
bjmsr-366	75	36	an	an	DET
bjmsr-366	75	37	experiment	experiment	NOUN
bjmsr-366	75	38	to	to	PART
bjmsr-366	75	39	compare	compare	VERB
bjmsr-366	75	40	the	the	DET
bjmsr-366	75	41	paths	path	NOUN
bjmsr-366	75	42	between	between	ADP
bjmsr-366	75	43	the	the	DET
bjmsr-366	75	44	nodes	node	NOUN
bjmsr-366	75	45	.	.	PUNCT
bjmsr-366	76	1	in	in	ADP
bjmsr-366	76	2	that	that	DET
bjmsr-366	76	3	paths	path	NOUN
bjmsr-366	76	4	,	,	PUNCT
bjmsr-366	76	5	the	the	DET
bjmsr-366	76	6	shortest	short	ADJ
bjmsr-366	76	7	path	path	NOUN
bjmsr-366	76	8	was	be	AUX
bjmsr-366	76	9	done	do	VERB
bjmsr-366	76	10	by	by	ADP
bjmsr-366	76	11	using	use	VERB
bjmsr-366	76	12	dijkstra‘s	dijkstra‘s	PROPN
bjmsr-366	76	13	algorithm	algorithm	NOUN
bjmsr-366	76	14	.	.	PUNCT
bjmsr-366	77	1	here	here	ADV
bjmsr-366	77	2	the	the	DET
bjmsr-366	77	3	shortest	short	ADJ
bjmsr-366	77	4	path	path	NOUN
bjmsr-366	77	5	it	it	PRON
bjmsr-366	77	6	means	mean	VERB
bjmsr-366	77	7	low	low	ADJ
bjmsr-366	77	8	cost	cost	NOUN
bjmsr-366	77	9	was	be	AUX
bjmsr-366	77	10	found	find	VERB
bjmsr-366	77	11	by	by	ADP
bjmsr-366	77	12	the	the	DET
bjmsr-366	77	13	shortest	short	ADJ
bjmsr-366	77	14	path	path	NOUN
bjmsr-366	77	15	algorithm	algorithm	NOUN
bjmsr-366	77	16	.	.	PUNCT
bjmsr-366	78	1	here	here	ADV
bjmsr-366	78	2	java	java	PROPN
bjmsr-366	78	3	code	code	PROPN
bjmsr-366	78	4	uses	use	VERB
bjmsr-366	78	5	the	the	DET
bjmsr-366	78	6	applets	applet	NOUN
bjmsr-366	78	7	so	so	SCONJ
bjmsr-366	78	8	that	that	SCONJ
bjmsr-366	78	9	applet	applet	NOUN
bjmsr-366	78	10	viewer	viewer	NOUN
bjmsr-366	78	11	shows	show	VERB
bjmsr-366	78	12	how	how	SCONJ
bjmsr-366	78	13	the	the	DET
bjmsr-366	78	14	shortest	short	ADJ
bjmsr-366	78	15	path	path	NOUN
bjmsr-366	78	16	was	be	AUX
bjmsr-366	78	17	done	do	VERB
bjmsr-366	78	18	.	.	PUNCT
bjmsr-366	79	1	with	with	ADP
bjmsr-366	79	2	the	the	DET
bjmsr-366	79	3	use	use	NOUN
bjmsr-366	79	4	of	of	ADP
bjmsr-366	79	5	java	java	PROPN
bjmsr-366	79	6	software	software	PROPN
bjmsr-366	79	7	the	the	DET
bjmsr-366	79	8	result	result	NOUN
bjmsr-366	79	9	was	be	AUX
bjmsr-366	79	10	shown	show	VERB
bjmsr-366	79	11	in	in	ADP
bjmsr-366	79	12	the	the	DET
bjmsr-366	79	13	report	report	NOUN
bjmsr-366	79	14	.	.	PUNCT
bjmsr-366	80	1	we	we	PRON
bjmsr-366	80	2	have	have	AUX
bjmsr-366	80	3	got	get	VERB
bjmsr-366	80	4	successful	successful	ADJ
bjmsr-366	80	5	result	result	NOUN
bjmsr-366	80	6	.	.	PUNCT
bjmsr-366	81	1	the	the	DET
bjmsr-366	81	2	experiment	experiment	NOUN
bjmsr-366	81	3	was	be	AUX
bjmsr-366	81	4	successfully	successfully	ADV
bjmsr-366	81	5	complete	complete	ADJ
bjmsr-366	81	6	.	.	PUNCT
bjmsr-366	82	1	the	the	DET
bjmsr-366	82	2	result	result	NOUN
bjmsr-366	82	3	of	of	ADP
bjmsr-366	82	4	this	this	DET
bjmsr-366	82	5	project	project	NOUN
bjmsr-366	82	6	finding	find	VERB
bjmsr-366	82	7	the	the	DET
bjmsr-366	82	8	shortest	short	ADJ
bjmsr-366	82	9	path	path	NOUN
bjmsr-366	82	10	for	for	ADP
bjmsr-366	82	11	a	a	DET
bjmsr-366	82	12	single	single	ADJ
bjmsr-366	82	13	source	source	NOUN
bjmsr-366	82	14	to	to	ADP
bjmsr-366	82	15	all	all	DET
bjmsr-366	82	16	pairs	pair	NOUN
bjmsr-366	82	17	of	of	ADP
bjmsr-366	82	18	vertices	vertex	NOUN
bjmsr-366	82	19	by	by	ADP
bjmsr-366	82	20	using	use	VERB
bjmsr-366	82	21	the	the	DET
bjmsr-366	82	22	dijkstra	dijkstra	PROPN
bjmsr-366	82	23	’s	’s	PART
bjmsr-366	82	24	algorithm	algorithm	NOUN
bjmsr-366	82	25	.	.	PUNCT
bjmsr-366	83	1	it	it	PRON
bjmsr-366	83	2	gives	give	VERB
bjmsr-366	83	3	the	the	DET
bjmsr-366	83	4	cheapest	cheap	ADJ
bjmsr-366	83	5	cost	cost	NOUN
bjmsr-366	83	6	and	and	CCONJ
bjmsr-366	83	7	its	its	PRON
bjmsr-366	83	8	implementation	implementation	NOUN
bjmsr-366	83	9	is	be	AUX
bjmsr-366	83	10	easy	easy	ADJ
bjmsr-366	83	11	.	.	PUNCT
bjmsr-366	84	1	copyright	copyright	NOUN
bjmsr-366	84	2	©	©	PROPN
bjmsr-366	84	3	cc	cc	PROPN
bjmsr-366	84	4	-	-	PUNCT
bjmsr-366	84	5	by	by	ADP
bjmsr-366	84	6	-	-	PUNCT
bjmsr-366	84	7	nc	nc	PROPN
bjmsr-366	84	8	2019	2019	NUM
bjmsr-366	84	9	,	,	PUNCT
bjmsr-366	84	10	bjmsr	bjmsr	PROPN
bjmsr-366	84	11	www.cribfb.com/journal/index.php/bjmsr	www.cribfb.com/journal/index.php/bjmsr	X
bjmsr-366	85	1	bangladesh	bangladesh	PROPN
bjmsr-366	85	2	journal	journal	PROPN
bjmsr-366	85	3	of	of	ADP
bjmsr-366	85	4	multidisciplinary	multidisciplinary	ADJ
bjmsr-366	85	5	scientific	scientific	ADJ
bjmsr-366	85	6	research	research	NOUN
bjmsr-366	85	7	vol	vol	NOUN
bjmsr-366	85	8	.	.	PROPN
bjmsr-366	85	9	1	1	NUM
bjmsr-366	85	10	,	,	PUNCT
bjmsr-366	85	11	no	no	INTJ
bjmsr-366	85	12	.	.	NOUN
bjmsr-366	85	13	2	2	NUM
bjmsr-366	85	14	;	;	PUNCT
bjmsr-366	85	15	2019	2019	NUM
bjmsr-366	85	16	44	44	NUM
bjmsr-366	85	17	5.1	5.1	NUM
bjmsr-366	85	18	initial	initial	ADJ
bjmsr-366	85	19	algorithm	algorithm	NOUN
bjmsr-366	85	20	running	running	NOUN
bjmsr-366	85	21	:	:	PUNCT
bjmsr-366	85	22	red	red	ADJ
bjmsr-366	85	23	arrows	arrow	NOUN
bjmsr-366	85	24	point	point	VERB
bjmsr-366	85	25	to	to	ADP
bjmsr-366	85	26	nodes	node	NOUN
bjmsr-366	85	27	reachable	reachable	ADJ
bjmsr-366	85	28	from	from	ADP
bjmsr-366	85	29	the	the	DET
bjmsr-366	85	30	start	start	NOUN
bjmsr-366	85	31	node	node	NOUN
bjmsr-366	85	32	.	.	PUNCT
bjmsr-366	86	1	the	the	DET
bjmsr-366	86	2	distance	distance	NOUN
bjmsr-366	86	3	to	to	ADP
bjmsr-366	86	4	:	:	PUNCT
bjmsr-366	86	5	b=55	b=55	NOUN
bjmsr-366	86	6	,	,	PUNCT
bjmsr-366	86	7	d=50	d=50	ADJ
bjmsr-366	86	8	,	,	PUNCT
bjmsr-366	86	9	f=100	f=100	PROPN
bjmsr-366	86	10	.	.	PUNCT
bjmsr-366	87	1	node	node	PROPN
bjmsr-366	87	2	d	d	PROPN
bjmsr-366	87	3	has	have	VERB
bjmsr-366	87	4	the	the	DET
bjmsr-366	87	5	minimum	minimum	ADJ
bjmsr-366	87	6	distance	distance	NOUN
bjmsr-366	87	7	.	.	PUNCT
bjmsr-366	88	1	there	there	PRON
bjmsr-366	88	2	is	be	VERB
bjmsr-366	88	3	no	no	DET
bjmsr-366	88	4	other	other	ADJ
bjmsr-366	88	5	arrows	arrow	NOUN
bjmsr-366	88	6	coming	come	VERB
bjmsr-366	88	7	in	in	ADP
bjmsr-366	88	8	to	to	ADP
bjmsr-366	88	9	d.	d.	PROPN
bjmsr-366	88	10	node	node	PROPN
bjmsr-366	88	11	d	d	PROPN
bjmsr-366	88	12	will	will	AUX
bjmsr-366	88	13	be	be	AUX
bjmsr-366	88	14	colored	color	VERB
bjmsr-366	88	15	orange	orange	ADJ
bjmsr-366	88	16	to	to	PART
bjmsr-366	88	17	indicate	indicate	VERB
bjmsr-366	88	18	50	50	NUM
bjmsr-366	88	19	is	be	AUX
bjmsr-366	88	20	the	the	DET
bjmsr-366	88	21	length	length	NOUN
bjmsr-366	88	22	of	of	ADP
bjmsr-366	88	23	the	the	DET
bjmsr-366	88	24	shortest	short	ADJ
bjmsr-366	88	25	path	path	NOUN
bjmsr-366	88	26	to	to	ADP
bjmsr-366	88	27	d.	d.	PROPN
bjmsr-366	88	28	5.2	5.2	NUM
bjmsr-366	88	29	final	final	ADJ
bjmsr-366	88	30	orange	orange	NOUN
bjmsr-366	88	31	arrows	arrow	NOUN
bjmsr-366	88	32	point	point	NOUN
bjmsr-366	88	33	to	to	ADP
bjmsr-366	88	34	nodes	node	NOUN
bjmsr-366	88	35	reachable	reachable	ADJ
bjmsr-366	88	36	from	from	ADP
bjmsr-366	88	37	nodes	node	NOUN
bjmsr-366	88	38	that	that	PRON
bjmsr-366	88	39	already	already	ADV
bjmsr-366	88	40	have	have	VERB
bjmsr-366	88	41	a	a	DET
bjmsr-366	88	42	final	final	ADJ
bjmsr-366	88	43	distance	distance	NOUN
bjmsr-366	88	44	.	.	PUNCT
bjmsr-366	89	1	the	the	DET
bjmsr-366	89	2	distance	distance	NOUN
bjmsr-366	89	3	to	to	ADP
bjmsr-366	89	4	:	:	PUNCT
bjmsr-366	89	5	c=68.there	c=68.there	PRON
bjmsr-366	89	6	are	be	VERB
bjmsr-366	89	7	no	no	DET
bjmsr-366	89	8	other	other	ADJ
bjmsr-366	89	9	arrows	arrow	NOUN
bjmsr-366	89	10	coming	come	VERB
bjmsr-366	89	11	in	in	ADV
bjmsr-366	89	12	to	to	ADP
bjmsr-366	89	13	c.	c.	PROPN
bjmsr-366	89	14	node	node	PROPN
bjmsr-366	89	15	c	c	PROPN
bjmsr-366	89	16	will	will	AUX
bjmsr-366	89	17	be	be	AUX
bjmsr-366	89	18	colored	color	VERB
bjmsr-366	89	19	orange	orange	ADJ
bjmsr-366	89	20	to	to	PART
bjmsr-366	89	21	indicate	indicate	VERB
bjmsr-366	89	22	68	68	NUM
bjmsr-366	89	23	is	be	AUX
bjmsr-366	89	24	the	the	DET
bjmsr-366	89	25	length	length	NOUN
bjmsr-366	89	26	of	of	ADP
bjmsr-366	89	27	the	the	DET
bjmsr-366	89	28	shortest	short	ADJ
bjmsr-366	89	29	path	path	NOUN
bjmsr-366	89	30	to	to	ADP
bjmsr-366	89	31	c.	c.	PROPN
bjmsr-366	89	32	algorithm	algorithm	PROPN
bjmsr-366	89	33	has	have	AUX
bjmsr-366	89	34	finished	finish	VERB
bjmsr-366	89	35	,	,	PUNCT
bjmsr-366	89	36	follow	follow	VERB
bjmsr-366	89	37	orange	orange	ADJ
bjmsr-366	89	38	arrows	arrow	NOUN
bjmsr-366	89	39	from	from	ADP
bjmsr-366	89	40	start	start	NOUN
bjmsr-366	89	41	node	node	NOUN
bjmsr-366	89	42	to	to	ADP
bjmsr-366	89	43	any	any	DET
bjmsr-366	89	44	node	node	NOUN
bjmsr-366	89	45	to	to	PART
bjmsr-366	89	46	get	get	VERB
bjmsr-366	89	47	the	the	DET
bjmsr-366	89	48	shortest	short	ADJ
bjmsr-366	89	49	path	path	NOUN
bjmsr-366	89	50	to	to	ADP
bjmsr-366	89	51	the	the	DET
bjmsr-366	89	52	node	node	NOUN
bjmsr-366	89	53	.	.	PUNCT
bjmsr-366	90	1	6	6	NUM
bjmsr-366	90	2	.	.	X
bjmsr-366	90	3	conclusion	conclusion	NOUN
bjmsr-366	90	4	we	we	PRON
bjmsr-366	90	5	have	have	AUX
bjmsr-366	90	6	proposed	propose	VERB
bjmsr-366	90	7	a	a	DET
bjmsr-366	90	8	practical	practical	ADJ
bjmsr-366	90	9	algorithm	algorithm	NOUN
bjmsr-366	90	10	for	for	ADP
bjmsr-366	90	11	the	the	DET
bjmsr-366	90	12	shortest	short	ADJ
bjmsr-366	90	13	path	path	NOUN
bjmsr-366	90	14	problem	problem	NOUN
bjmsr-366	90	15	in	in	ADP
bjmsr-366	90	16	transportation	transportation	NOUN
bjmsr-366	90	17	networks	network	NOUN
bjmsr-366	90	18	.	.	PUNCT
bjmsr-366	91	1	the	the	DET
bjmsr-366	91	2	proposed	propose	VERB
bjmsr-366	91	3	algorithm	algorithm	NOUN
bjmsr-366	91	4	can	can	AUX
bjmsr-366	91	5	limit	limit	VERB
bjmsr-366	91	6	the	the	DET
bjmsr-366	91	7	search	search	NOUN
bjmsr-366	91	8	in	in	ADP
bjmsr-366	91	9	a	a	DET
bjmsr-366	91	10	sub	sub	NOUN
bjmsr-366	91	11	-	-	NOUN
bjmsr-366	91	12	graph	graph	NOUN
bjmsr-366	91	13	based	base	VERB
bjmsr-366	91	14	on	on	ADP
bjmsr-366	91	15	the	the	DET
bjmsr-366	91	16	given	give	VERB
bjmsr-366	91	17	nodes	node	NOUN
bjmsr-366	91	18	of	of	ADP
bjmsr-366	91	19	the	the	DET
bjmsr-366	91	20	distance	distance	NOUN
bjmsr-366	91	21	between	between	ADP
bjmsr-366	91	22	the	the	DET
bjmsr-366	91	23	two	two	NUM
bjmsr-366	91	24	nodes	node	NOUN
bjmsr-366	91	25	.	.	PUNCT
bjmsr-366	92	1	as	as	ADP
bjmsr-366	92	2	a	a	DET
bjmsr-366	92	3	b	b	NOUN
bjmsr-366	92	4	result	result	NOUN
bjmsr-366	92	5	,	,	PUNCT
bjmsr-366	92	6	the	the	DET
bjmsr-366	92	7	calculation	calculation	NOUN
bjmsr-366	92	8	for	for	ADP
bjmsr-366	92	9	the	the	DET
bjmsr-366	92	10	shortest	short	ADJ
bjmsr-366	92	11	path	path	NOUN
bjmsr-366	92	12	has	have	AUX
bjmsr-366	92	13	been	be	AUX
bjmsr-366	92	14	simplified	simplify	VERB
bjmsr-366	92	15	.	.	PUNCT
bjmsr-366	93	1	experimental	experimental	ADJ
bjmsr-366	93	2	results	result	NOUN
bjmsr-366	93	3	on	on	ADP
bjmsr-366	93	4	a	a	DET
bjmsr-366	93	5	real	real	ADJ
bjmsr-366	93	6	-	-	PUNCT
bjmsr-366	93	7	world	world	NOUN
bjmsr-366	93	8	road	road	NOUN
bjmsr-366	93	9	network	network	NOUN
bjmsr-366	93	10	reflect	reflect	VERB
bjmsr-366	93	11	the	the	DET
bjmsr-366	93	12	potential	potential	ADJ
bjmsr-366	93	13	characteristic	characteristic	NOUN
bjmsr-366	93	14	of	of	ADP
bjmsr-366	93	15	the	the	DET
bjmsr-366	93	16	proposed	propose	VERB
bjmsr-366	93	17	algorithm	algorithm	NOUN
bjmsr-366	93	18	in	in	ADP
bjmsr-366	93	19	comparison	comparison	NOUN
bjmsr-366	93	20	to	to	ADP
bjmsr-366	93	21	the	the	DET
bjmsr-366	93	22	existing	exist	VERB
bjmsr-366	93	23	works	work	NOUN
bjmsr-366	93	24	.	.	PUNCT
bjmsr-366	94	1	b	b	NOUN
bjmsr-366	94	2	applets	applet	NOUN
bjmsr-366	94	3	can	can	AUX
bjmsr-366	94	4	prove	prove	VERB
bjmsr-366	94	5	to	to	PART
bjmsr-366	94	6	be	be	AUX
bjmsr-366	94	7	very	very	ADV
bjmsr-366	94	8	helpful	helpful	ADJ
bjmsr-366	94	9	to	to	ADP
bjmsr-366	94	10	all	all	DET
bjmsr-366	94	11	the	the	DET
bjmsr-366	94	12	students	student	NOUN
bjmsr-366	94	13	,	,	PUNCT
bjmsr-366	94	14	in	in	ADP
bjmsr-366	94	15	general	general	ADJ
bjmsr-366	94	16	.	.	PUNCT
bjmsr-366	95	1	every	every	DET
bjmsr-366	95	2	student	student	NOUN
bjmsr-366	95	3	who	who	PRON
bjmsr-366	95	4	wishes	wish	VERB
bjmsr-366	95	5	to	to	PART
bjmsr-366	95	6	learn	learn	VERB
bjmsr-366	95	7	one	one	NUM
bjmsr-366	95	8	of	of	ADP
bjmsr-366	95	9	the	the	DET
bjmsr-366	95	10	algorithms	algorithm	NOUN
bjmsr-366	95	11	,	,	PUNCT
bjmsr-366	95	12	implemented	implement	VERB
bjmsr-366	95	13	in	in	ADP
bjmsr-366	95	14	this	this	DET
bjmsr-366	95	15	tool	tool	NOUN
bjmsr-366	95	16	,	,	PUNCT
bjmsr-366	95	17	may	may	AUX
bjmsr-366	95	18	use	use	VERB
bjmsr-366	95	19	the	the	DET
bjmsr-366	95	20	proposed	propose	VERB
bjmsr-366	95	21	applet	applet	NOUN
bjmsr-366	95	22	from	from	ADP
bjmsr-366	95	23	any	any	DET
bjmsr-366	95	24	remote	remote	ADJ
bjmsr-366	95	25	place	place	NOUN
bjmsr-366	95	26	,	,	PUNCT
bjmsr-366	95	27	probably	probably	ADV
bjmsr-366	95	28	his	his	PRON
bjmsr-366	95	29	home	home	NOUN
bjmsr-366	95	30	.	.	PUNCT
bjmsr-366	96	1	it	it	PRON
bjmsr-366	96	2	does	do	AUX
bjmsr-366	96	3	n’t	not	PART
bjmsr-366	96	4	matter	matter	VERB
bjmsr-366	96	5	what	what	PRON
bjmsr-366	96	6	his	his	PRON
bjmsr-366	96	7	system	system	NOUN
bjmsr-366	96	8	is	be	AUX
bjmsr-366	96	9	.	.	PUNCT
bjmsr-366	97	1	it	it	PRON
bjmsr-366	97	2	only	only	ADV
bjmsr-366	97	3	requires	require	VERB
bjmsr-366	97	4	that	that	SCONJ
bjmsr-366	97	5	the	the	DET
bjmsr-366	97	6	java	java	PROPN
bjmsr-366	97	7	virtual	virtual	ADJ
bjmsr-366	97	8	machine	machine	NOUN
bjmsr-366	97	9	,	,	PUNCT
bjmsr-366	97	10	(	(	PUNCT
bjmsr-366	97	11	jvm	jvm	PROPN
bjmsr-366	97	12	)	)	PUNCT
bjmsr-366	97	13	,	,	PUNCT
bjmsr-366	97	14	is	be	AUX
bjmsr-366	97	15	installed	instal	VERB
bjmsr-366	97	16	into	into	ADP
bjmsr-366	97	17	his	his	PRON
bjmsr-366	97	18	system	system	NOUN
bjmsr-366	97	19	.	.	PUNCT
bjmsr-366	98	1	it	it	PRON
bjmsr-366	98	2	should	should	AUX
bjmsr-366	98	3	be	be	AUX
bjmsr-366	98	4	pointed	point	VERB
bjmsr-366	98	5	out	out	ADP
bjmsr-366	98	6	that	that	SCONJ
bjmsr-366	98	7	jvm	jvm	PROPN
bjmsr-366	98	8	is	be	AUX
bjmsr-366	98	9	freely	freely	ADV
bjmsr-366	98	10	available	available	ADJ
bjmsr-366	98	11	for	for	ADP
bjmsr-366	98	12	download	download	NOUN
bjmsr-366	98	13	from	from	ADP
bjmsr-366	98	14	sun	sun	NOUN
bjmsr-366	98	15	microsystems	microsystem	NOUN
bjmsr-366	98	16	.	.	PUNCT
bjmsr-366	99	1	moreover	moreover	ADV
bjmsr-366	99	2	there	there	PRON
bjmsr-366	99	3	is	be	VERB
bjmsr-366	99	4	an	an	DET
bjmsr-366	99	5	intention	intention	NOUN
bjmsr-366	99	6	to	to	PART
bjmsr-366	99	7	enhance	enhance	VERB
bjmsr-366	99	8	the	the	DET
bjmsr-366	99	9	graph	graph	NOUN
bjmsr-366	99	10	editor	editor	NOUN
bjmsr-366	99	11	,	,	PUNCT
bjmsr-366	99	12	in	in	ADP
bjmsr-366	99	13	order	order	NOUN
bjmsr-366	99	14	that	that	SCONJ
bjmsr-366	99	15	the	the	DET
bjmsr-366	99	16	user	user	NOUN
bjmsr-366	99	17	would	would	AUX
bjmsr-366	99	18	be	be	AUX
bjmsr-366	99	19	able	able	ADJ
bjmsr-366	99	20	to	to	PART
bjmsr-366	99	21	draw	draw	VERB
bjmsr-366	99	22	undirected	undirected	ADJ
bjmsr-366	99	23	graphs	graph	NOUN
bjmsr-366	99	24	,	,	PUNCT
bjmsr-366	99	25	or	or	CCONJ
bjmsr-366	99	26	networks	network	NOUN
bjmsr-366	99	27	,	,	PUNCT
bjmsr-366	99	28	as	as	ADV
bjmsr-366	99	29	well	well	ADV
bjmsr-366	99	30	.	.	PUNCT
bjmsr-366	100	1	yet	yet	ADV
bjmsr-366	100	2	this	this	DET
bjmsr-366	100	3	applet	applet	NOUN
bjmsr-366	100	4	could	could	AUX
bjmsr-366	100	5	be	be	AUX
bjmsr-366	100	6	further	far	ADV
bjmsr-366	100	7	enriched	enrich	VERB
bjmsr-366	100	8	,	,	PUNCT
bjmsr-366	100	9	and	and	CCONJ
bjmsr-366	100	10	possibly	possibly	ADV
bjmsr-366	100	11	visualize	visualize	VERB
bjmsr-366	100	12	more	more	ADJ
bjmsr-366	100	13	algorithms	algorithm	NOUN
bjmsr-366	100	14	for	for	ADP
bjmsr-366	100	15	digraphs	digraph	NOUN
bjmsr-366	100	16	.	.	PUNCT
bjmsr-366	101	1	directed	direct	VERB
bjmsr-366	101	2	networks	network	NOUN
bjmsr-366	101	3	such	such	ADJ
bjmsr-366	101	4	as	as	ADP
bjmsr-366	101	5	the	the	DET
bjmsr-366	101	6	primal	primal	ADJ
bjmsr-366	101	7	simplex	simplex	NOUN
bjmsr-366	101	8	algorithm	algorithm	NOUN
bjmsr-366	101	9	which	which	PRON
bjmsr-366	101	10	solves	solve	VERB
bjmsr-366	101	11	the	the	DET
bjmsr-366	101	12	minimum	minimum	ADJ
bjmsr-366	101	13	cost	cost	NOUN
bjmsr-366	101	14	network	network	NOUN
bjmsr-366	101	15	flow	flow	NOUN
bjmsr-366	101	16	problem	problem	NOUN
bjmsr-366	101	17	(	(	PUNCT
bjmsr-366	101	18	mcnfp	mcnfp	NOUN
bjmsr-366	101	19	)	)	PUNCT
bjmsr-366	101	20	.	.	PUNCT
bjmsr-366	102	1	besides	besides	SCONJ
bjmsr-366	102	2	more	more	ADJ
bjmsr-366	102	3	algorithms	algorithm	NOUN
bjmsr-366	102	4	will	will	AUX
bjmsr-366	102	5	be	be	AUX
bjmsr-366	102	6	added	add	VERB
bjmsr-366	102	7	for	for	ADP
bjmsr-366	102	8	undirected	undirected	ADJ
bjmsr-366	102	9	graphs	graph	NOUN
bjmsr-366	102	10	such	such	ADJ
bjmsr-366	102	11	as	as	ADP
bjmsr-366	102	12	the	the	DET
bjmsr-366	102	13	kruskal	kruskal	NOUN
bjmsr-366	102	14	’s	’s	PART
bjmsr-366	102	15	and	and	CCONJ
bjmsr-366	102	16	prim	prim	VERB
bjmsr-366	102	17	’s	’s	PART
bjmsr-366	102	18	algorithms	algorithm	NOUN
bjmsr-366	102	19	which	which	PRON
bjmsr-366	102	20	solve	solve	VERB
bjmsr-366	102	21	the	the	DET
bjmsr-366	102	22	minimum	minimum	ADJ
bjmsr-366	102	23	spanning	span	VERB
bjmsr-366	102	24	tree	tree	NOUN
bjmsr-366	102	25	(	(	PUNCT
bjmsr-366	102	26	mst	mst	PROPN
bjmsr-366	102	27	)	)	PUNCT
bjmsr-366	102	28	problem	problem	NOUN
bjmsr-366	102	29	.	.	PUNCT
bjmsr-366	103	1	future	future	ADJ
bjmsr-366	103	2	work	work	NOUN
bjmsr-366	103	3	in	in	ADP
bjmsr-366	103	4	future	future	ADJ
bjmsr-366	103	5	release	release	NOUN
bjmsr-366	103	6	the	the	DET
bjmsr-366	103	7	applet	applet	NOUN
bjmsr-366	103	8	will	will	AUX
bjmsr-366	103	9	be	be	AUX
bjmsr-366	103	10	modified	modify	VERB
bjmsr-366	103	11	,	,	PUNCT
bjmsr-366	103	12	in	in	ADP
bjmsr-366	103	13	order	order	NOUN
bjmsr-366	103	14	to	to	PART
bjmsr-366	103	15	be	be	AUX
bjmsr-366	103	16	executed	execute	VERB
bjmsr-366	103	17	as	as	ADP
bjmsr-366	103	18	standalone	standalone	NOUN
bjmsr-366	103	19	java	java	NOUN
bjmsr-366	103	20	application	application	NOUN
bjmsr-366	103	21	as	as	ADV
bjmsr-366	103	22	well	well	ADV
bjmsr-366	103	23	.	.	PUNCT
bjmsr-366	104	1	in	in	ADP
bjmsr-366	104	2	addition	addition	NOUN
bjmsr-366	104	3	,	,	PUNCT
bjmsr-366	104	4	certain	certain	ADJ
bjmsr-366	104	5	questionnaires	questionnaire	NOUN
bjmsr-366	104	6	will	will	AUX
bjmsr-366	104	7	be	be	AUX
bjmsr-366	104	8	given	give	VERB
bjmsr-366	104	9	to	to	ADP
bjmsr-366	104	10	the	the	DET
bjmsr-366	104	11	students	student	NOUN
bjmsr-366	104	12	of	of	ADP
bjmsr-366	104	13	our	our	PRON
bjmsr-366	104	14	department	department	NOUN
bjmsr-366	104	15	to	to	PART
bjmsr-366	104	16	be	be	AUX
bjmsr-366	104	17	filled	fill	VERB
bjmsr-366	104	18	in	in	ADP
bjmsr-366	104	19	,	,	PUNCT
bjmsr-366	104	20	in	in	ADP
bjmsr-366	104	21	order	order	NOUN
bjmsr-366	104	22	to	to	PART
bjmsr-366	104	23	get	get	VERB
bjmsr-366	104	24	feedback	feedback	NOUN
bjmsr-366	104	25	.	.	PUNCT
bjmsr-366	105	1	this	this	PRON
bjmsr-366	105	2	is	be	AUX
bjmsr-366	105	3	very	very	ADV
bjmsr-366	105	4	important	important	ADJ
bjmsr-366	105	5	,	,	PUNCT
bjmsr-366	105	6	to	to	PART
bjmsr-366	105	7	improve	improve	VERB
bjmsr-366	105	8	and	and	CCONJ
bjmsr-366	105	9	evaluate	evaluate	VERB
bjmsr-366	105	10	the	the	DET
bjmsr-366	105	11	teaching	teaching	NOUN
bjmsr-366	105	12	effectiveness	effectiveness	NOUN
bjmsr-366	105	13	of	of	ADP
bjmsr-366	105	14	our	our	PRON
bjmsr-366	105	15	applet	applet	NOUN
bjmsr-366	105	16	in	in	ADP
bjmsr-366	105	17	real	real	ADJ
bjmsr-366	105	18	instruction	instruction	NOUN
bjmsr-366	105	19	environment	environment	NOUN
bjmsr-366	105	20	.	.	PUNCT
bjmsr-366	106	1	students	student	NOUN
bjmsr-366	106	2	will	will	AUX
bjmsr-366	106	3	also	also	ADV
bjmsr-366	106	4	be	be	AUX
bjmsr-366	106	5	encouraged	encourage	VERB
bjmsr-366	106	6	to	to	PART
bjmsr-366	106	7	construct	construct	VERB
bjmsr-366	106	8	their	their	PRON
bjmsr-366	106	9	own	own	ADJ
bjmsr-366	106	10	applets	applet	NOUN
bjmsr-366	106	11	.	.	PUNCT
bjmsr-366	107	1	references	reference	NOUN
bjmsr-366	107	2	aghaei	aghaei	PROPN
bjmsr-366	107	3	,	,	PUNCT
bjmsr-366	107	4	m.	m.	PROPN
bjmsr-366	107	5	r.	r.	PROPN
bjmsr-366	107	6	s.	s.	PROPN
bjmsr-366	107	7	,	,	PUNCT
bjmsr-366	107	8	zukarnain	zukarnain	PROPN
bjmsr-366	107	9	,	,	PUNCT
bjmsr-366	107	10	z.	z.	PROPN
bjmsr-366	107	11	a.	a.	PROPN
bjmsr-366	107	12	,	,	PUNCT
bjmsr-366	107	13	mamat	mamat	PROPN
bjmsr-366	107	14	,	,	PUNCT
bjmsr-366	107	15	a.	a.	PROPN
bjmsr-366	107	16	,	,	PUNCT
bjmsr-366	107	17	&	&	CCONJ
bjmsr-366	107	18	zainuddin	zainuddin	PROPN
bjmsr-366	107	19	,	,	PUNCT
bjmsr-366	107	20	h.	h.	PROPN
bjmsr-366	107	21	(	(	PUNCT
bjmsr-366	107	22	2008	2008	NUM
bjmsr-366	107	23	,	,	PUNCT
bjmsr-366	107	24	december	december	PROPN
bjmsr-366	107	25	)	)	PUNCT
bjmsr-366	107	26	.	.	PUNCT
bjmsr-366	108	1	a	a	DET
bjmsr-366	108	2	hybrid	hybrid	ADJ
bjmsr-366	108	3	algorithm	algorithm	NOUN
bjmsr-366	108	4	for	for	ADP
bjmsr-366	108	5	the	the	DET
bjmsr-366	108	6	shortest	short	ADJ
bjmsr-366	108	7	-	-	PUNCT
bjmsr-366	108	8	path	path	NOUN
bjmsr-366	108	9	problem	problem	NOUN
bjmsr-366	108	10	in	in	ADP
bjmsr-366	108	11	the	the	DET
bjmsr-366	108	12	graph	graph	NOUN
bjmsr-366	108	13	.	.	PUNCT
bjmsr-366	109	1	in	in	ADP
bjmsr-366	109	2	2008	2008	NUM
bjmsr-366	109	3	international	international	ADJ
bjmsr-366	109	4	conference	conference	NOUN
bjmsr-366	109	5	on	on	ADP
bjmsr-366	109	6	advanced	advanced	ADJ
bjmsr-366	109	7	computer	computer	NOUN
bjmsr-366	109	8	theory	theory	NOUN
bjmsr-366	109	9	and	and	CCONJ
bjmsr-366	109	10	engineering	engineering	NOUN
bjmsr-366	109	11	(	(	PUNCT
bjmsr-366	109	12	pp	pp	ADJ
bjmsr-366	109	13	.	.	PUNCT
bjmsr-366	109	14	251255	251255	NUM
bjmsr-366	109	15	)	)	PUNCT
bjmsr-366	109	16	.	.	PUNCT
bjmsr-366	110	1	ieee	ieee	PROPN
bjmsr-366	110	2	.	.	PUNCT
bjmsr-366	110	3	abbas	abbas	PROPN
bjmsr-366	110	4	,	,	PUNCT
bjmsr-366	110	5	m.	m.	NOUN
bjmsr-366	110	6	a.	a.	PROPN
bjmsr-366	110	7	,	,	PUNCT
bjmsr-366	110	8	chumachenko	chumachenko	PROPN
bjmsr-366	110	9	,	,	PUNCT
bjmsr-366	110	10	s.	s.	PROPN
bjmsr-366	110	11	v.	v.	PROPN
bjmsr-366	110	12	,	,	PUNCT
bjmsr-366	110	13	hahanova	hahanova	PROPN
bjmsr-366	110	14	,	,	PUNCT
bjmsr-366	110	15	a.	a.	PROPN
bjmsr-366	110	16	v.	v.	PROPN
bjmsr-366	110	17	,	,	PUNCT
bjmsr-366	110	18	gorobets	gorobet	NOUN
bjmsr-366	110	19	,	,	PUNCT
bjmsr-366	110	20	a.	a.	NOUN
bjmsr-366	110	21	a.	a.	PROPN
bjmsr-366	110	22	,	,	PUNCT
bjmsr-366	110	23	&	&	CCONJ
bjmsr-366	110	24	priymak	priymak	PROPN
bjmsr-366	110	25	,	,	PUNCT
bjmsr-366	110	26	a.	a.	PROPN
bjmsr-366	110	27	(	(	PUNCT
bjmsr-366	110	28	2013	2013	NUM
bjmsr-366	110	29	,	,	PUNCT
bjmsr-366	110	30	september	september	PROPN
bjmsr-366	110	31	)	)	PUNCT
bjmsr-366	110	32	.	.	PUNCT
bjmsr-366	111	1	models	model	NOUN
bjmsr-366	111	2	for	for	ADP
bjmsr-366	111	3	quality	quality	NOUN
bjmsr-366	111	4	analysis	analysis	NOUN
bjmsr-366	111	5	of	of	ADP
bjmsr-366	111	6	computer	computer	NOUN
bjmsr-366	111	7	structures	structure	NOUN
bjmsr-366	111	8	.	.	PUNCT
bjmsr-366	112	1	in	in	ADP
bjmsr-366	112	2	east	east	PROPN
bjmsr-366	112	3	-	-	PUNCT
bjmsr-366	112	4	west	west	PROPN
bjmsr-366	112	5	design	design	PROPN
bjmsr-366	112	6	&	&	CCONJ
bjmsr-366	112	7	test	test	PROPN
bjmsr-366	112	8	symposium	symposium	NOUN
bjmsr-366	112	9	(	(	PUNCT
bjmsr-366	112	10	ewdts	ewdts	NOUN
bjmsr-366	112	11	2013	2013	NUM
bjmsr-366	112	12	)	)	PUNCT
bjmsr-366	112	13	(	(	PUNCT
bjmsr-366	112	14	pp	pp	X
bjmsr-366	112	15	.	.	PUNCT
bjmsr-366	113	1	1	1	NUM
bjmsr-366	113	2	-	-	SYM
bjmsr-366	113	3	6	6	NUM
bjmsr-366	113	4	)	)	PUNCT
bjmsr-366	113	5	.	.	PUNCT
bjmsr-366	114	1	ieee	ieee	PROPN
bjmsr-366	114	2	.	.	PROPN
bjmsr-366	114	3	alzahrani	alzahrani	PROPN
bjmsr-366	114	4	,	,	PUNCT
bjmsr-366	114	5	a.	a.	PROPN
bjmsr-366	114	6	s.	s.	PROPN
bjmsr-366	114	7	,	,	PUNCT
bjmsr-366	114	8	&	&	CCONJ
bjmsr-366	114	9	woodward	woodward	PROPN
bjmsr-366	114	10	,	,	PUNCT
bjmsr-366	114	11	m.	m.	PROPN
bjmsr-366	114	12	e.	e.	PROPN
bjmsr-366	114	13	(	(	PUNCT
bjmsr-366	114	14	2008	2008	NUM
bjmsr-366	114	15	,	,	PUNCT
bjmsr-366	114	16	november	november	PROPN
bjmsr-366	114	17	)	)	PUNCT
bjmsr-366	114	18	.	.	PUNCT
bjmsr-366	115	1	end	end	NOUN
bjmsr-366	115	2	-	-	PUNCT
bjmsr-366	115	3	to	to	ADP
bjmsr-366	115	4	-	-	PUNCT
bjmsr-366	115	5	end	end	NOUN
bjmsr-366	115	6	delay	delay	NOUN
bjmsr-366	115	7	in	in	ADP
bjmsr-366	115	8	localized	localized	ADJ
bjmsr-366	115	9	qos	qos	NOUN
bjmsr-366	115	10	routing	routing	NOUN
bjmsr-366	115	11	.	.	PUNCT
bjmsr-366	116	1	in	in	ADP
bjmsr-366	116	2	2008	2008	NUM
bjmsr-366	116	3	11th	11th	NOUN
bjmsr-366	116	4	ieee	ieee	PROPN
bjmsr-366	116	5	singapore	singapore	PROPN
bjmsr-366	116	6	international	international	PROPN
bjmsr-366	116	7	conference	conference	PROPN
bjmsr-366	116	8	on	on	ADP
bjmsr-366	116	9	communication	communication	NOUN
bjmsr-366	116	10	systems	system	NOUN
bjmsr-366	116	11	(	(	PUNCT
bjmsr-366	116	12	pp	pp	ADJ
bjmsr-366	116	13	.	.	PUNCT
bjmsr-366	117	1	1700	1700	NUM
bjmsr-366	117	2	-	-	SYM
bjmsr-366	117	3	1706	1706	NUM
bjmsr-366	117	4	)	)	PUNCT
bjmsr-366	117	5	.	.	PUNCT
bjmsr-366	118	1	ieee	ieee	PROPN
bjmsr-366	118	2	.	.	PUNCT
bjmsr-366	119	1	dobrilovic	dobrilovic	PROPN
bjmsr-366	119	2	,	,	PUNCT
bjmsr-366	119	3	d.	d.	PROPN
bjmsr-366	119	4	,	,	PUNCT
bjmsr-366	119	5	jevtic	jevtic	PROPN
bjmsr-366	119	6	,	,	PUNCT
bjmsr-366	119	7	v.	v.	ADV
bjmsr-366	119	8	,	,	PUNCT
bjmsr-366	119	9	beker	beker	NOUN
bjmsr-366	119	10	,	,	PUNCT
bjmsr-366	119	11	i.	i.	PROPN
bjmsr-366	119	12	,	,	PUNCT
bjmsr-366	119	13	&	&	CCONJ
bjmsr-366	119	14	stojanov	stojanov	PROPN
bjmsr-366	119	15	,	,	PUNCT
bjmsr-366	119	16	z.	z.	PROPN
bjmsr-366	119	17	(	(	PUNCT
bjmsr-366	119	18	2012	2012	NUM
bjmsr-366	119	19	,	,	PUNCT
bjmsr-366	119	20	may	may	AUX
bjmsr-366	119	21	)	)	PUNCT
bjmsr-366	119	22	.	.	PUNCT
bjmsr-366	120	1	shortest	short	ADJ
bjmsr-366	120	2	-	-	PUNCT
bjmsr-366	120	3	path	path	NOUN
bjmsr-366	120	4	based	base	VERB
bjmsr-366	120	5	model	model	NOUN
bjmsr-366	120	6	for	for	ADP
bjmsr-366	120	7	warehouse	warehouse	NOUN
bjmsr-366	120	8	inner	inner	ADJ
bjmsr-366	120	9	transportation	transportation	NOUN
bjmsr-366	120	10	optimization	optimization	NOUN
bjmsr-366	120	11	.	.	PUNCT
bjmsr-366	121	1	in	in	ADP
bjmsr-366	121	2	2012	2012	NUM
bjmsr-366	121	3	7th	7th	ADJ
bjmsr-366	121	4	ieee	ieee	NOUN
bjmsr-366	121	5	international	international	ADJ
bjmsr-366	121	6	symposium	symposium	NOUN
bjmsr-366	121	7	on	on	ADP
bjmsr-366	121	8	applied	apply	VERB
bjmsr-366	121	9	computational	computational	ADJ
bjmsr-366	121	10	intelligence	intelligence	NOUN
bjmsr-366	121	11	and	and	CCONJ
bjmsr-366	121	12	informatics	informatics	PROPN
bjmsr-366	121	13	(	(	PUNCT
bjmsr-366	121	14	saci)(pp	saci)(pp	PROPN
bjmsr-366	121	15	.	.	PUNCT
bjmsr-366	121	16	63	63	NUM
bjmsr-366	121	17	-	-	SYM
bjmsr-366	121	18	68	68	NUM
bjmsr-366	121	19	)	)	PUNCT
bjmsr-366	121	20	.	.	PUNCT
bjmsr-366	122	1	ieee	ieee	PROPN
bjmsr-366	122	2	.	.	PUNCT
bjmsr-366	123	1	fuhao	fuhao	PROPN
bjmsr-366	123	2	,	,	PUNCT
bjmsr-366	123	3	z.	z.	PROPN
bjmsr-366	123	4	,	,	PUNCT
bjmsr-366	123	5	&	&	CCONJ
bjmsr-366	123	6	jiping	jiping	PROPN
bjmsr-366	123	7	,	,	PUNCT
bjmsr-366	123	8	l.	l.	PROPN
bjmsr-366	123	9	(	(	PUNCT
bjmsr-366	123	10	2009	2009	NUM
bjmsr-366	123	11	,	,	PUNCT
bjmsr-366	123	12	august	august	PROPN
bjmsr-366	123	13	)	)	PUNCT
bjmsr-366	123	14	.	.	PUNCT
bjmsr-366	124	1	an	an	DET
bjmsr-366	124	2	algorithm	algorithm	NOUN
bjmsr-366	124	3	of	of	ADP
bjmsr-366	124	4	shortest	short	ADJ
bjmsr-366	124	5	path	path	NOUN
bjmsr-366	124	6	based	base	VERB
bjmsr-366	124	7	on	on	ADP
bjmsr-366	124	8	dijkstra	dijkstra	PROPN
bjmsr-366	124	9	for	for	ADP
bjmsr-366	124	10	huge	huge	ADJ
bjmsr-366	124	11	data	datum	NOUN
bjmsr-366	124	12	.	.	PUNCT
bjmsr-366	125	1	in	in	ADP
bjmsr-366	125	2	2009	2009	NUM
bjmsr-366	125	3	sixth	sixth	ADJ
bjmsr-366	125	4	international	international	ADJ
bjmsr-366	125	5	conference	conference	NOUN
bjmsr-366	125	6	on	on	ADP
bjmsr-366	125	7	fuzzy	fuzzy	ADJ
bjmsr-366	125	8	systems	system	NOUN
bjmsr-366	125	9	and	and	CCONJ
bjmsr-366	125	10	knowledge	knowledge	NOUN
bjmsr-366	125	11	discovery	discovery	NOUN
bjmsr-366	125	12	(	(	PUNCT
bjmsr-366	125	13	vol	vol	NOUN
bjmsr-366	125	14	.	.	PROPN
bjmsr-366	125	15	4	4	NUM
bjmsr-366	125	16	,	,	PUNCT
bjmsr-366	125	17	pp	pp	ADJ
bjmsr-366	125	18	.	.	PUNCT
bjmsr-366	126	1	244	244	NUM
bjmsr-366	126	2	-	-	SYM
bjmsr-366	126	3	247	247	NUM
bjmsr-366	126	4	)	)	PUNCT
bjmsr-366	126	5	.	.	PUNCT
bjmsr-366	127	1	ieee	ieee	PROPN
bjmsr-366	127	2	.	.	PUNCT
bjmsr-366	128	1	guo	guo	PROPN
bjmsr-366	128	2	,	,	PUNCT
bjmsr-366	128	3	l.	l.	PROPN
bjmsr-366	128	4	,	,	PUNCT
bjmsr-366	128	5	yang	yang	PROPN
bjmsr-366	128	6	,	,	PUNCT
bjmsr-366	128	7	q.	q.	PROPN
bjmsr-366	128	8	,	,	PUNCT
bjmsr-366	128	9	&	&	CCONJ
bjmsr-366	128	10	yan	yan	PROPN
bjmsr-366	128	11	,	,	PUNCT
bjmsr-366	128	12	w.	w.	PROPN
bjmsr-366	128	13	(	(	PUNCT
bjmsr-366	128	14	2012	2012	NUM
bjmsr-366	128	15	,	,	PUNCT
bjmsr-366	128	16	september	september	PROPN
bjmsr-366	128	17	)	)	PUNCT
bjmsr-366	128	18	.	.	PUNCT
bjmsr-366	129	1	intelligent	intelligent	ADJ
bjmsr-366	129	2	path	path	NOUN
bjmsr-366	129	3	planning	planning	NOUN
bjmsr-366	129	4	for	for	ADP
bjmsr-366	129	5	automated	automate	VERB
bjmsr-366	129	6	guided	guide	VERB
bjmsr-366	129	7	vehicles	vehicle	NOUN
bjmsr-366	129	8	system	system	NOUN
bjmsr-366	129	9	based	base	VERB
bjmsr-366	129	10	on	on	ADP
bjmsr-366	129	11	topological	topological	ADJ
bjmsr-366	129	12	map	map	NOUN
bjmsr-366	129	13	.	.	PUNCT
bjmsr-366	130	1	in	in	ADP
bjmsr-366	130	2	2012	2012	NUM
bjmsr-366	130	3	ieee	ieee	NOUN
bjmsr-366	130	4	conference	conference	NOUN
bjmsr-366	130	5	on	on	ADP
bjmsr-366	130	6	control	control	NOUN
bjmsr-366	130	7	,	,	PUNCT
bjmsr-366	130	8	systems	system	NOUN
bjmsr-366	130	9	&	&	CCONJ
bjmsr-366	130	10	industrial	industrial	ADJ
bjmsr-366	130	11	informatics	informatic	NOUN
bjmsr-366	130	12	(	(	PUNCT
bjmsr-366	130	13	pp	pp	ADJ
bjmsr-366	130	14	.	.	PUNCT
bjmsr-366	131	1	69	69	NUM
bjmsr-366	131	2	-	-	SYM
bjmsr-366	131	3	74	74	NUM
bjmsr-366	131	4	)	)	PUNCT
bjmsr-366	131	5	.	.	PUNCT
bjmsr-366	132	1	ieee	ieee	PROPN
bjmsr-366	132	2	.	.	PUNCT
bjmsr-366	133	1	jan	jan	PROPN
bjmsr-366	133	2	,	,	PUNCT
bjmsr-366	133	3	g.	g.	PROPN
bjmsr-366	133	4	e.	e.	PROPN
bjmsr-366	133	5	,	,	PUNCT
bjmsr-366	133	6	lee	lee	PROPN
bjmsr-366	133	7	,	,	PUNCT
bjmsr-366	133	8	m.	m.	PROPN
bjmsr-366	133	9	c.	c.	PROPN
bjmsr-366	133	10	,	,	PUNCT
bjmsr-366	133	11	hsieh	hsieh	PROPN
bjmsr-366	133	12	,	,	PUNCT
bjmsr-366	133	13	s.	s.	PROPN
bjmsr-366	133	14	g.	g.	PROPN
bjmsr-366	133	15	,	,	PUNCT
bjmsr-366	133	16	&	&	CCONJ
bjmsr-366	133	17	chen	chen	PROPN
bjmsr-366	133	18	,	,	PUNCT
bjmsr-366	133	19	y.	y.	PROPN
bjmsr-366	133	20	y.	y.	PROPN
bjmsr-366	133	21	(	(	PUNCT
bjmsr-366	133	22	2009	2009	NUM
bjmsr-366	133	23	,	,	PUNCT
bjmsr-366	133	24	july	july	PROPN
bjmsr-366	133	25	)	)	PUNCT
bjmsr-366	133	26	.	.	PUNCT
bjmsr-366	134	1	transportation	transportation	NOUN
bjmsr-366	134	2	network	network	NOUN
bjmsr-366	134	3	navigation	navigation	NOUN
bjmsr-366	134	4	with	with	ADP
bjmsr-366	134	5	turn	turn	NOUN
bjmsr-366	134	6	penalties	penalty	NOUN
bjmsr-366	134	7	.	.	PUNCT
bjmsr-366	135	1	in	in	ADP
bjmsr-366	135	2	2009	2009	NUM
bjmsr-366	135	3	ieee	ieee	PROPN
bjmsr-366	135	4	/	/	SYM
bjmsr-366	135	5	asme	asme	PROPN
bjmsr-366	135	6	international	international	PROPN
bjmsr-366	135	7	conference	conference	PROPN
bjmsr-366	135	8	on	on	ADP
bjmsr-366	135	9	advanced	advanced	ADJ
bjmsr-366	135	10	intelligent	intelligent	ADJ
bjmsr-366	135	11	mechatronics	mechatronic	NOUN
bjmsr-366	135	12	(	(	PUNCT
bjmsr-366	135	13	pp	pp	ADJ
bjmsr-366	135	14	.	.	PUNCT
bjmsr-366	136	1	1224	1224	NUM
bjmsr-366	136	2	-	-	SYM
bjmsr-366	136	3	1229	1229	NUM
bjmsr-366	136	4	)	)	PUNCT
bjmsr-366	136	5	.	.	PUNCT
bjmsr-366	137	1	ieee	ieee	PROPN
bjmsr-366	137	2	.	.	PUNCT
bjmsr-366	138	1	jigang	jigang	PROPN
bjmsr-366	138	2	,	,	PUNCT
bjmsr-366	138	3	w.	w.	PROPN
bjmsr-366	138	4	,	,	PUNCT
bjmsr-366	138	5	han	han	PROPN
bjmsr-366	138	6	,	,	PUNCT
bjmsr-366	138	7	p.	p.	NOUN
bjmsr-366	138	8	,	,	PUNCT
bjmsr-366	138	9	jagadeesh	jagadeesh	PROPN
bjmsr-366	138	10	,	,	PUNCT
bjmsr-366	138	11	g.	g.	PROPN
bjmsr-366	138	12	r.	r.	PROPN
bjmsr-366	138	13	,	,	PUNCT
bjmsr-366	138	14	&	&	CCONJ
bjmsr-366	138	15	srikanthan	srikanthan	PROPN
bjmsr-366	138	16	,	,	PUNCT
bjmsr-366	138	17	t.	t.	PROPN
bjmsr-366	138	18	(	(	PUNCT
bjmsr-366	138	19	2010	2010	NUM
bjmsr-366	138	20	)	)	PUNCT
bjmsr-366	138	21	.	.	PUNCT
bjmsr-366	139	1	practical	practical	ADJ
bjmsr-366	139	2	algorithm	algorithm	NOUN
bjmsr-366	139	3	for	for	ADP
bjmsr-366	139	4	shortest	short	ADJ
bjmsr-366	139	5	path	path	NOUN
bjmsr-366	139	6	on	on	ADP
bjmsr-366	139	7	large	large	ADJ
bjmsr-366	139	8	networks	network	NOUN
bjmsr-366	139	9	with	with	ADP
bjmsr-366	139	10	time	time	NOUN
bjmsr-366	139	11	-	-	PUNCT
bjmsr-366	139	12	dependent	dependent	ADJ
bjmsr-366	139	13	edge	edge	NOUN
bjmsr-366	139	14	-	-	PUNCT
bjmsr-366	139	15	length	length	NOUN
bjmsr-366	139	16	.	.	PUNCT
bjmsr-366	140	1	in	in	ADP
bjmsr-366	140	2	2010	2010	NUM
bjmsr-366	140	3	2nd	2nd	ADJ
bjmsr-366	140	4	international	international	ADJ
bjmsr-366	140	5	conference	conference	NOUN
bjmsr-366	140	6	on	on	ADP
bjmsr-366	140	7	computer	computer	NOUN
bjmsr-366	140	8	engineering	engineering	NOUN
bjmsr-366	140	9	and	and	CCONJ
bjmsr-366	140	10	technology	technology	NOUN
bjmsr-366	140	11	.	.	PUNCT
bjmsr-366	141	1	jain	jain	PROPN
bjmsr-366	141	2	,	,	PUNCT
bjmsr-366	141	3	a.	a.	PROPN
bjmsr-366	141	4	,	,	PUNCT
bjmsr-366	141	5	datta	datta	PROPN
bjmsr-366	141	6	,	,	PUNCT
bjmsr-366	141	7	u.	u.	PROPN
bjmsr-366	141	8	,	,	PUNCT
bjmsr-366	141	9	&	&	CCONJ
bjmsr-366	141	10	joshi	joshi	PROPN
bjmsr-366	141	11	,	,	PUNCT
bjmsr-366	141	12	n.	n.	PROPN
bjmsr-366	141	13	(	(	PUNCT
bjmsr-366	141	14	2016	2016	NUM
bjmsr-366	141	15	)	)	PUNCT
bjmsr-366	141	16	.	.	PUNCT
bjmsr-366	142	1	implemented	implement	VERB
bjmsr-366	142	2	modification	modification	NOUN
bjmsr-366	142	3	in	in	ADP
bjmsr-366	142	4	dijkstra‟	dijkstra‟	PROPN
bjmsr-366	142	5	s	s	NOUN
bjmsr-366	142	6	algorithm	algorithm	NOUN
bjmsr-366	142	7	to	to	PART
bjmsr-366	142	8	find	find	VERB
bjmsr-366	142	9	the	the	DET
bjmsr-366	142	10	shortest	short	ADJ
bjmsr-366	142	11	path	path	NOUN
bjmsr-366	142	12	for	for	ADP
bjmsr-366	142	13	n	n	DET
bjmsr-366	142	14	nodes	node	NOUN
bjmsr-366	142	15	with	with	ADP
bjmsr-366	142	16	constraint	constraint	NOUN
bjmsr-366	142	17	.	.	PUNCT
bjmsr-366	143	1	international	international	ADJ
bjmsr-366	143	2	journal	journal	PROPN
bjmsr-366	143	3	of	of	ADP
bjmsr-366	143	4	scientific	scientific	ADJ
bjmsr-366	143	5	engineering	engineering	NOUN
bjmsr-366	143	6	and	and	CCONJ
bjmsr-366	143	7	applied	apply	VERB
bjmsr-366	143	8	science	science	NOUN
bjmsr-366	143	9	,	,	PUNCT
bjmsr-366	143	10	2(2	2(2	NUM
bjmsr-366	143	11	)	)	PUNCT
bjmsr-366	143	12	,	,	PUNCT
bjmsr-366	143	13	420	420	NUM
bjmsr-366	143	14	-	-	SYM
bjmsr-366	143	15	426	426	NUM
bjmsr-366	143	16	wu	wu	PROPN
bjmsr-366	143	17	,	,	PUNCT
bjmsr-366	143	18	h.	h.	PROPN
bjmsr-366	143	19	,	,	PUNCT
bjmsr-366	143	20	marshall	marshall	PROPN
bjmsr-366	143	21	,	,	PUNCT
bjmsr-366	143	22	a.	a.	PROPN
bjmsr-366	143	23	,	,	PUNCT
bjmsr-366	143	24	&	&	CCONJ
bjmsr-366	143	25	yu	yu	PROPN
bjmsr-366	143	26	,	,	PUNCT
bjmsr-366	143	27	w.	w.	PROPN
bjmsr-366	143	28	(	(	PUNCT
bjmsr-366	143	29	2007	2007	NUM
bjmsr-366	143	30	,	,	PUNCT
bjmsr-366	143	31	july	july	PROPN
bjmsr-366	143	32	)	)	PUNCT
bjmsr-366	143	33	.	.	PUNCT
bjmsr-366	144	1	path	path	NOUN
bjmsr-366	144	2	planning	planning	NOUN
bjmsr-366	144	3	and	and	CCONJ
bjmsr-366	144	4	following	follow	VERB
bjmsr-366	144	5	algorithms	algorithm	NOUN
bjmsr-366	144	6	in	in	ADP
bjmsr-366	144	7	an	an	DET
bjmsr-366	144	8	indoor	indoor	ADJ
bjmsr-366	144	9	navigation	navigation	NOUN
bjmsr-366	144	10	model	model	NOUN
bjmsr-366	144	11	for	for	ADP
bjmsr-366	144	12	visually	visually	ADV
bjmsr-366	144	13	impaired	impaired	ADJ
bjmsr-366	144	14	.	.	PUNCT
bjmsr-366	145	1	in	in	ADP
bjmsr-366	145	2	second	second	ADJ
bjmsr-366	145	3	international	international	ADJ
bjmsr-366	145	4	conference	conference	NOUN
bjmsr-366	145	5	on	on	ADP
bjmsr-366	145	6	internet	internet	NOUN
bjmsr-366	145	7	monitoring	monitoring	NOUN
bjmsr-366	145	8	and	and	CCONJ
bjmsr-366	145	9	protection	protection	NOUN
bjmsr-366	145	10	(	(	PUNCT
bjmsr-366	145	11	icimp	icimp	NOUN
bjmsr-366	145	12	2007	2007	NUM
bjmsr-366	145	13	)	)	PUNCT
bjmsr-366	145	14	(	(	PUNCT
bjmsr-366	145	15	pp	pp	ADV
bjmsr-366	145	16	.	.	PUNCT
bjmsr-366	146	1	38	38	NUM
bjmsr-366	146	2	-	-	SYM
bjmsr-366	146	3	38	38	NUM
bjmsr-366	146	4	)	)	PUNCT
bjmsr-366	146	5	.	.	PUNCT
bjmsr-366	147	1	ieee	ieee	PROPN
bjmsr-366	147	2	.	.	PUNCT
bjmsr-366	148	1	copyright	copyright	NOUN
bjmsr-366	148	2	©	©	PROPN
bjmsr-366	148	3	cc	cc	PROPN
bjmsr-366	148	4	-	-	PUNCT
bjmsr-366	148	5	by	by	ADP
bjmsr-366	148	6	-	-	PUNCT
bjmsr-366	148	7	nc	nc	PROPN
bjmsr-366	148	8	2019	2019	NUM
bjmsr-366	148	9	,	,	PUNCT
bjmsr-366	148	10	bjmsr	bjmsr	PROPN
bjmsr-366	148	11	www.cribfb.com/journal/index.php/bjmsr	www.cribfb.com/journal/index.php/bjmsr	X
bjmsr-366	149	1	bangladesh	bangladesh	PROPN
bjmsr-366	149	2	journal	journal	PROPN
bjmsr-366	149	3	of	of	ADP
bjmsr-366	149	4	multidisciplinary	multidisciplinary	ADJ
bjmsr-366	149	5	scientific	scientific	ADJ
bjmsr-366	149	6	research	research	NOUN
bjmsr-366	149	7	vol	vol	NOUN
bjmsr-366	149	8	.	.	PROPN
bjmsr-366	149	9	1	1	NUM
bjmsr-366	149	10	,	,	PUNCT
bjmsr-366	149	11	no	no	INTJ
bjmsr-366	149	12	.	.	NOUN
bjmsr-366	149	13	2	2	NUM
bjmsr-366	149	14	;	;	PUNCT
bjmsr-366	149	15	2019	2019	NUM
bjmsr-366	149	16	45	45	NUM
bjmsr-366	149	17	wang	wang	PROPN
bjmsr-366	149	18	,	,	PUNCT
bjmsr-366	149	19	h.	h.	PROPN
bjmsr-366	149	20	,	,	PUNCT
bjmsr-366	149	21	hu	hu	PROPN
bjmsr-366	149	22	,	,	PUNCT
bjmsr-366	149	23	m.	m.	NOUN
bjmsr-366	149	24	,	,	PUNCT
bjmsr-366	149	25	&	&	CCONJ
bjmsr-366	149	26	xiao	xiao	PROPN
bjmsr-366	149	27	,	,	PUNCT
bjmsr-366	149	28	w.	w.	PROPN
bjmsr-366	149	29	(	(	PUNCT
bjmsr-366	149	30	2010	2010	NUM
bjmsr-366	149	31	,	,	PUNCT
bjmsr-366	149	32	march	march	PROPN
bjmsr-366	149	33	)	)	PUNCT
bjmsr-366	149	34	.	.	PUNCT
bjmsr-366	150	1	a	a	DET
bjmsr-366	150	2	new	new	ADJ
bjmsr-366	150	3	public	public	ADJ
bjmsr-366	150	4	transportation	transportation	NOUN
bjmsr-366	150	5	data	datum	NOUN
bjmsr-366	150	6	model	model	NOUN
bjmsr-366	150	7	and	and	CCONJ
bjmsr-366	150	8	shortest	short	ADJ
bjmsr-366	150	9	-	-	PUNCT
bjmsr-366	150	10	path	path	NOUN
bjmsr-366	150	11	algorithms	algorithm	NOUN
bjmsr-366	150	12	.	.	PUNCT
bjmsr-366	151	1	in	in	ADP
bjmsr-366	151	2	2010	2010	NUM
bjmsr-366	151	3	2nd	2nd	PROPN
bjmsr-366	151	4	international	international	PROPN
bjmsr-366	151	5	asia	asia	PROPN
bjmsr-366	151	6	conference	conference	PROPN
bjmsr-366	151	7	on	on	ADP
bjmsr-366	151	8	informatics	informatic	NOUN
bjmsr-366	151	9	in	in	ADP
bjmsr-366	151	10	control	control	NOUN
bjmsr-366	151	11	,	,	PUNCT
bjmsr-366	151	12	automation	automation	NOUN
bjmsr-366	151	13	and	and	CCONJ
bjmsr-366	151	14	robotics	robotic	NOUN
bjmsr-366	151	15	(	(	PUNCT
bjmsr-366	151	16	car	car	NOUN
bjmsr-366	151	17	2010	2010	NUM
bjmsr-366	151	18	)	)	PUNCT
bjmsr-366	151	19	(	(	PUNCT
bjmsr-366	151	20	vol	vol	NOUN
bjmsr-366	151	21	.	.	NOUN
bjmsr-366	151	22	1	1	NUM
bjmsr-366	151	23	,	,	PUNCT
bjmsr-366	151	24	pp	pp	ADJ
bjmsr-366	151	25	.	.	PUNCT
bjmsr-366	152	1	456	456	NUM
bjmsr-366	152	2	-	-	NUM
bjmsr-366	152	3	459	459	NUM
bjmsr-366	152	4	)	)	PUNCT
bjmsr-366	152	5	.	.	PUNCT
bjmsr-366	153	1	ieee	ieee	PROPN
bjmsr-366	153	2	.	.	PUNCT
bjmsr-366	154	1	xiao	xiao	PROPN
bjmsr-366	154	2	,	,	PUNCT
bjmsr-366	154	3	j.	j.	PROPN
bjmsr-366	154	4	x.	x.	PROPN
bjmsr-366	154	5	,	,	PUNCT
bjmsr-366	154	6	&	&	CCONJ
bjmsr-366	154	7	lu	lu	PROPN
bjmsr-366	154	8	,	,	PUNCT
bjmsr-366	154	9	f.	f.	PROPN
bjmsr-366	154	10	l.	l.	PROPN
bjmsr-366	154	11	(	(	PUNCT
bjmsr-366	154	12	2010	2010	NUM
bjmsr-366	154	13	,	,	PUNCT
bjmsr-366	154	14	february	february	PROPN
bjmsr-366	154	15	)	)	PUNCT
bjmsr-366	154	16	.	.	PUNCT
bjmsr-366	155	1	an	an	DET
bjmsr-366	155	2	improvement	improvement	NOUN
bjmsr-366	155	3	of	of	ADP
bjmsr-366	155	4	the	the	DET
bjmsr-366	155	5	shortest	short	ADJ
bjmsr-366	155	6	path	path	NOUN
bjmsr-366	155	7	algorithm	algorithm	NOUN
bjmsr-366	155	8	based	base	VERB
bjmsr-366	155	9	on	on	ADP
bjmsr-366	155	10	dijkstra	dijkstra	ADJ
bjmsr-366	155	11	algorithm	algorithm	NOUN
bjmsr-366	155	12	.	.	PUNCT
bjmsr-366	156	1	in	in	ADP
bjmsr-366	156	2	2010	2010	NUM
bjmsr-366	156	3	the	the	DET
bjmsr-366	156	4	2nd	2nd	ADJ
bjmsr-366	156	5	international	international	ADJ
bjmsr-366	156	6	conference	conference	NOUN
bjmsr-366	156	7	on	on	ADP
bjmsr-366	156	8	computer	computer	NOUN
bjmsr-366	156	9	and	and	CCONJ
bjmsr-366	156	10	automation	automation	NOUN
bjmsr-366	156	11	engineering	engineering	NOUN
bjmsr-366	156	12	(	(	PUNCT
bjmsr-366	156	13	iccae	iccae	PROPN
bjmsr-366	156	14	)	)	PUNCT
bjmsr-366	156	15	(	(	PUNCT
bjmsr-366	156	16	vol	vol	NOUN
bjmsr-366	156	17	.	.	NOUN
bjmsr-366	156	18	2	2	NUM
bjmsr-366	156	19	,	,	PUNCT
bjmsr-366	156	20	pp	pp	ADJ
bjmsr-366	156	21	.	.	PUNCT
bjmsr-366	156	22	383	383	NUM
bjmsr-366	156	23	-	-	SYM
bjmsr-366	156	24	385	385	NUM
bjmsr-366	156	25	)	)	PUNCT
bjmsr-366	156	26	.	.	PUNCT
bjmsr-366	157	1	ieee	ieee	PROPN
bjmsr-366	157	2	.	.	PUNCT
bjmsr-366	157	3	yin	yin	PROPN
bjmsr-366	157	4	,	,	PUNCT
bjmsr-366	157	5	c.	c.	PROPN
bjmsr-366	157	6	,	,	PUNCT
bjmsr-366	157	7	&	&	CCONJ
bjmsr-366	157	8	wang	wang	PROPN
bjmsr-366	157	9	,	,	PUNCT
bjmsr-366	157	10	h.	h.	PROPN
bjmsr-366	157	11	(	(	PUNCT
bjmsr-366	157	12	2010	2010	NUM
bjmsr-366	157	13	,	,	PUNCT
bjmsr-366	157	14	june	june	PROPN
bjmsr-366	157	15	)	)	PUNCT
bjmsr-366	157	16	.	.	PUNCT
bjmsr-366	157	17	developed	develop	VERB
bjmsr-366	157	18	dijkstra	dijkstra	ADJ
bjmsr-366	157	19	shortest	short	ADJ
bjmsr-366	157	20	path	path	NOUN
bjmsr-366	157	21	search	search	NOUN
bjmsr-366	157	22	algorithm	algorithm	NOUN
bjmsr-366	157	23	and	and	CCONJ
bjmsr-366	157	24	simulation	simulation	NOUN
bjmsr-366	157	25	.	.	PUNCT
bjmsr-366	158	1	in	in	ADP
bjmsr-366	158	2	2010	2010	NUM
bjmsr-366	158	3	international	international	ADJ
bjmsr-366	158	4	conference	conference	NOUN
bjmsr-366	158	5	on	on	ADP
bjmsr-366	158	6	computer	computer	NOUN
bjmsr-366	158	7	design	design	NOUN
bjmsr-366	158	8	and	and	CCONJ
bjmsr-366	158	9	applications	application	NOUN
bjmsr-366	158	10	(	(	PUNCT
bjmsr-366	158	11	vol	vol	NOUN
bjmsr-366	158	12	.	.	NOUN
bjmsr-366	158	13	1	1	NUM
bjmsr-366	158	14	,	,	PUNCT
bjmsr-366	158	15	pp	pp	ADJ
bjmsr-366	158	16	.	.	PUNCT
bjmsr-366	158	17	v1	v1	NOUN
bjmsr-366	158	18	-	-	PUNCT
bjmsr-366	158	19	116	116	NUM
bjmsr-366	158	20	)	)	PUNCT
bjmsr-366	158	21	.	.	PUNCT
bjmsr-366	159	1	ieee	ieee	PROPN
bjmsr-366	159	2	.	.	PUNCT
bjmsr-366	160	1	zhang	zhang	PROPN
bjmsr-366	160	2	,	,	PUNCT
bjmsr-366	160	3	z.	z.	PROPN
bjmsr-366	160	4	,	,	PUNCT
bjmsr-366	160	5	jigang	jigang	PROPN
bjmsr-366	160	6	,	,	PUNCT
bjmsr-366	160	7	w.	w.	PROPN
bjmsr-366	160	8	,	,	PUNCT
bjmsr-366	160	9	&	&	CCONJ
bjmsr-366	160	10	duan	duan	PROPN
bjmsr-366	160	11	,	,	PUNCT
bjmsr-366	160	12	x.	x.	PROPN
bjmsr-366	160	13	(	(	PUNCT
bjmsr-366	160	14	2010	2010	NUM
bjmsr-366	160	15	,	,	PUNCT
bjmsr-366	160	16	december	december	PROPN
bjmsr-366	160	17	)	)	PUNCT
bjmsr-366	160	18	.	.	PUNCT
bjmsr-366	161	1	practical	practical	ADJ
bjmsr-366	161	2	algorithm	algorithm	NOUN
bjmsr-366	161	3	for	for	ADP
bjmsr-366	161	4	shortest	short	ADJ
bjmsr-366	161	5	path	path	NOUN
bjmsr-366	161	6	on	on	ADP
bjmsr-366	161	7	transportation	transportation	NOUN
bjmsr-366	161	8	network	network	NOUN
bjmsr-366	161	9	.	.	PUNCT
bjmsr-366	162	1	in	in	ADP
bjmsr-366	162	2	2010	2010	NUM
bjmsr-366	162	3	international	international	ADJ
bjmsr-366	162	4	conference	conference	NOUN
bjmsr-366	162	5	on	on	ADP
bjmsr-366	162	6	computer	computer	NOUN
bjmsr-366	162	7	and	and	CCONJ
bjmsr-366	162	8	information	information	NOUN
bjmsr-366	162	9	application	application	NOUN
bjmsr-366	162	10	(	(	PUNCT
bjmsr-366	162	11	pp	pp	ADJ
bjmsr-366	162	12	.	.	PUNCT
bjmsr-366	163	1	48	48	NUM
bjmsr-366	163	2	-	-	SYM
bjmsr-366	163	3	51	51	NUM
bjmsr-366	163	4	)	)	PUNCT
bjmsr-366	163	5	.	.	PUNCT
bjmsr-366	164	1	ieee	ieee	PROPN
bjmsr-366	164	2	.	.	PUNCT
bjmsr-366	165	1	zhan	zhan	PROPN
bjmsr-366	165	2	,	,	PUNCT
bjmsr-366	165	3	f.	f.	PROPN
bjmsr-366	165	4	b.	b.	PROPN
bjmsr-366	165	5	,	,	PUNCT
bjmsr-366	165	6	&	&	CCONJ
bjmsr-366	165	7	noon	noon	NOUN
bjmsr-366	165	8	,	,	PUNCT
bjmsr-366	165	9	c.	c.	PROPN
bjmsr-366	165	10	e.	e.	PROPN
bjmsr-366	165	11	(	(	PUNCT
bjmsr-366	165	12	1998	1998	NUM
bjmsr-366	165	13	)	)	PUNCT
bjmsr-366	165	14	.	.	PUNCT
bjmsr-366	166	1	shortest	short	ADJ
bjmsr-366	166	2	path	path	NOUN
bjmsr-366	166	3	algorithms	algorithm	NOUN
bjmsr-366	166	4	:	:	PUNCT
bjmsr-366	166	5	an	an	DET
bjmsr-366	166	6	evaluation	evaluation	NOUN
bjmsr-366	166	7	using	use	VERB
bjmsr-366	166	8	real	real	ADJ
bjmsr-366	166	9	road	road	NOUN
bjmsr-366	166	10	networks	network	NOUN
bjmsr-366	166	11	.	.	PUNCT
bjmsr-366	167	1	transportation	transportation	NOUN
bjmsr-366	167	2	science	science	NOUN
bjmsr-366	167	3	,	,	PUNCT
bjmsr-366	167	4	32(1	32(1	NUM
bjmsr-366	167	5	)	)	PUNCT
bjmsr-366	167	6	,	,	PUNCT
bjmsr-366	167	7	65	65	NUM
bjmsr-366	167	8	-	-	SYM
bjmsr-366	167	9	73	73	NUM
bjmsr-366	167	10	.	.	PUNCT
bjmsr-366	168	1	zhou	zhou	PROPN
bjmsr-366	168	2	,	,	PUNCT
bjmsr-366	168	3	w.	w.	PROPN
bjmsr-366	168	4	,	,	PUNCT
bjmsr-366	168	5	qiu	qiu	PROPN
bjmsr-366	168	6	,	,	PUNCT
bjmsr-366	168	7	q.	q.	PROPN
bjmsr-366	168	8	,	,	PUNCT
bjmsr-366	168	9	luo	luo	PROPN
bjmsr-366	168	10	,	,	PUNCT
bjmsr-366	168	11	p.	p.	NOUN
bjmsr-366	168	12	,	,	PUNCT
bjmsr-366	168	13	&	&	CCONJ
bjmsr-366	168	14	fang	fang	PROPN
bjmsr-366	168	15	,	,	PUNCT
bjmsr-366	168	16	p.	p.	NOUN
bjmsr-366	168	17	(	(	PUNCT
bjmsr-366	168	18	2013	2013	NUM
bjmsr-366	168	19	,	,	PUNCT
bjmsr-366	168	20	june	june	PROPN
bjmsr-366	168	21	)	)	PUNCT
bjmsr-366	168	22	.	.	PUNCT
bjmsr-366	169	1	an	an	DET
bjmsr-366	169	2	improved	improved	ADJ
bjmsr-366	169	3	shortest	short	ADJ
bjmsr-366	169	4	path	path	NOUN
bjmsr-366	169	5	algorithm	algorithm	NOUN
bjmsr-366	169	6	based	base	VERB
bjmsr-366	169	7	on	on	ADP
bjmsr-366	169	8	orientation	orientation	NOUN
bjmsr-366	169	9	rectangle	rectangle	NOUN
bjmsr-366	169	10	for	for	ADP
bjmsr-366	169	11	restricted	restricted	ADJ
bjmsr-366	169	12	searching	searching	NOUN
bjmsr-366	169	13	area	area	NOUN
bjmsr-366	169	14	.	.	PUNCT
bjmsr-366	170	1	in	in	ADP
bjmsr-366	170	2	proceedings	proceeding	NOUN
bjmsr-366	170	3	of	of	ADP
bjmsr-366	170	4	the	the	DET
bjmsr-366	170	5	2013	2013	NUM
bjmsr-366	170	6	ieee	ieee	NOUN
bjmsr-366	170	7	17th	17th	NOUN
bjmsr-366	170	8	international	international	ADJ
bjmsr-366	170	9	conference	conference	NOUN
bjmsr-366	170	10	on	on	ADP
bjmsr-366	170	11	computer	computer	NOUN
bjmsr-366	170	12	supported	support	VERB
bjmsr-366	170	13	cooperative	cooperative	ADJ
bjmsr-366	170	14	work	work	NOUN
bjmsr-366	170	15	in	in	ADP
bjmsr-366	170	16	design	design	NOUN
bjmsr-366	170	17	(	(	PUNCT
bjmsr-366	170	18	cscwd	cscwd	NOUN
bjmsr-366	170	19	)	)	PUNCT
bjmsr-366	170	20	(	(	PUNCT
bjmsr-366	170	21	pp	pp	ADV
bjmsr-366	170	22	.	.	PUNCT
bjmsr-366	171	1	692	692	NUM
bjmsr-366	171	2	-	-	NUM
bjmsr-366	171	3	697	697	NUM
bjmsr-366	171	4	)	)	PUNCT
bjmsr-366	171	5	.	.	PUNCT
bjmsr-366	172	1	ieee	ieee	PROPN
bjmsr-366	172	2	.	.	PUNCT
bjmsr-366	173	1	copyrights	copyright	VERB
bjmsr-366	173	2	copyright	copyright	NOUN
bjmsr-366	173	3	for	for	ADP
bjmsr-366	173	4	this	this	DET
bjmsr-366	173	5	article	article	NOUN
bjmsr-366	173	6	is	be	AUX
bjmsr-366	173	7	retained	retain	VERB
bjmsr-366	173	8	by	by	ADP
bjmsr-366	173	9	the	the	DET
bjmsr-366	173	10	author(s	author(s	PROPN
bjmsr-366	173	11	)	)	PUNCT
bjmsr-366	173	12	,	,	PUNCT
bjmsr-366	173	13	with	with	ADP
bjmsr-366	173	14	first	first	ADJ
bjmsr-366	173	15	publication	publication	NOUN
bjmsr-366	173	16	rights	right	NOUN
bjmsr-366	173	17	granted	grant	VERB
bjmsr-366	173	18	to	to	ADP
bjmsr-366	173	19	the	the	DET
bjmsr-366	173	20	journal	journal	NOUN
bjmsr-366	173	21	.	.	PUNCT
bjmsr-366	174	1	this	this	PRON
bjmsr-366	174	2	is	be	AUX
bjmsr-366	174	3	an	an	DET
bjmsr-366	174	4	open	open	ADJ
bjmsr-366	174	5	-	-	PUNCT
bjmsr-366	174	6	access	access	NOUN
bjmsr-366	174	7	article	article	NOUN
bjmsr-366	174	8	distributed	distribute	VERB
bjmsr-366	174	9	under	under	ADP
bjmsr-366	174	10	the	the	DET
bjmsr-366	174	11	terms	term	NOUN
bjmsr-366	174	12	and	and	CCONJ
bjmsr-366	174	13	conditions	condition	NOUN
bjmsr-366	174	14	of	of	ADP
bjmsr-366	174	15	the	the	DET
bjmsr-366	174	16	creative	creative	ADJ
bjmsr-366	174	17	commons	common	NOUN
bjmsr-366	174	18	attribution	attribution	NOUN
bjmsr-366	174	19	license	license	NOUN
bjmsr-366	174	20	(	(	PUNCT
bjmsr-366	174	21	http://creativecommons.org/licenses/by/4.0/	http://creativecommons.org/licenses/by/4.0/	PROPN
bjmsr-366	174	22	)	)	PUNCT
bjmsr-366	174	23	.	.	PUNCT