• MINIMUM SPANNING WITH DIJKSTRA’S ALGORITHM
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:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |