Abstract
When a system or process is represented as a graph and a unique interconnection between the quantities is desired the problem is one of selecting a spanning tree. Each spanning tree gives a unique path between vertices, but there are many spanning trees for a graph.An algorithm for the selection of a minimal spanning tree for a given weighted connected graph, or a minimal spanning forest for a disconnected weighted graph is presented. The algorithm utilizes sparse matrix techniques, and the basic concept of ring sum operations to obtain the spanning tree, or forest. The minimality of the resultant spanning tree, or forest is proven. In addition, timing and storage requirements are determined. Several cases are studied including the worst case. The only restriction placed on the graphs is that they do not have any isolated vertices.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
