• Farzana Mohammadi

Graph theory plays an important role for shortest path calculation. The algorithms used in calculating the shortest distance can also be used in determining the minimum cost also. There are many algorithms available in the literature which use graph theory to find any shortest path between any two destinations. This paper aims to find the shortest path between two cities namely, Nemroz and Mumbai. Nemroz is situated in Afghanistan and Mumbai is in India. The article determines the optimal cost for trading between these two cities by using Dijktra’s Algorithm.

"On Finding The Minimum Path For Trade Between Nemroz To Mumbai", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 1, page no.720-723, January 2019, Available :http://www.jetir.org/papers/JETIRDY06115.pdf

"On Finding The Minimum Path For Trade Between Nemroz To Mumbai", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 1, page no. pp720-723, January 2019, Available at : http://www.jetir.org/papers/JETIRDY06115.pdf