• MINIMUM SPANNING WITH DIJKSTRA’S ALGORITHM

J. MOHAN, S. PRABHAVATHI, R. MUTHUKUMAR, N. SANGEETHA, C. AROCKIYADASS, S. DICKSON*

Abstract


A tree is an undirected graph in which any two vertices are connected by exactly one path. There are many kinds of trees, but in this paper to discussing about what is a minimum spanning tree and how it can be applied in real life situations

Keywords


Connected graph, undirected graph, spanning tree, sub-graph, edges, vertex.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
© 2010-2018 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter