A solution to the problem of finding an optimal spanning tree using the computer

• Main Authors: Adriano, Jonathan Ty, Labayen, Rose Jocelyn Marie Lopez
• Format: text
• Language: English
• Published: Animo Repository 1991
• Subjects: Trees (Graph theory); Programming (Mathematics); Problem solving
• Online Access: https://animorepository.dlsu.edu.ph/etd_bachelors/15943
• Institution: De La Salle University

This paper presents two algorithms in finding an optimal (minimum or maximum) spanning tree of a given weighted, simple, connected graph G on n vertices, where 1 n 10. The algorithms, which are a version of Kruskal's and Prim's algorithms combined, are coded into two programming languages...