• SHORTEST DISTANCE FROM SPANNING TREE
Abstract
In this paper, verify minimum duration using spanning tree. In duration of Program Evaluate and Review Technique Method (PERT) problem compare with Prim’s algorithm and Kruskal’s algorithm.
Keywords
Network, PERT, Shortest spanning tree, Connected Graph.
Full Text:
PDF
This 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 |