Prim’s vs dijktra’s algorithms and its analysis

	International Journal of P2P Network Trends and Technology (IJPTT)
	© 2017 by IJPTT Journal
	Volume - 7 Issue - 2
	Year of Publication : 2017
	Authors : Dania Farooq
	DOI :  10.14445/22492615/IJPTT-V31P401

Citation

Dania Farooq "Prim’s vs dijktra’s algorithms and its analysis". International Journal of P2P Network Trends and Technology (IJPTT), V7(2):1-6 Mar - Apr 2017, ISSN:2249-2615, www.ijpttjournal.org, Published by Seventh Sense Research Group.

Abstract

Where vary the difference between prims and dijktra algorithms which both relay on same concept but solve two different problems. Prims is the minimum spanning tree and used for a graph and provide shortest path. Dijktra are also use for shortest path and to find out the shortest path, so they are little differ with each other. In our research paper we will display the prims and dijktra algorithms with the help of example to solve out the problems and will show which the best to use to solve the problems is.

References

[1] “Prims algorithm introduction”/Wikipedia/wiki/
[2] “Dijktra’s algorithm introduction”/ html/wiki/
[3] Difference between Prims and dijktra’s algorithm /wiki/ notes/
[4] Quora “Difference b/w Prims and dijktra’s /
[5]www.ms.unimelb.edu/”Dijktra”/mosh
[6]“Prims algorithm”/codes/notes/
[7] “Prims complexity”/ 27/notes/Lo7/207/
[8]”Dijktra’s detail”/wiki/org.notes/
[9] “Dijktra’s introduction”/video/institute/
[10] www.Prims.org/ introduction/notes/codes

Keywords
In our research paper we will display the prims and dijktra algorithms with the help of example to solve out the problems and will show which the best to use to solve the problems is.