Scribd Logo
Upload

Welcome to Scribd!

  • Minimum Spanning Tree

    Uploaded by

    Romel Bucaloy
    4 views1 page
    This document presents a minimal spanning tree problem represented by a graph with 12 nodes connected by weighted edges. The solution finds the minimum total distance by connecting all nodes using the edges with the lowest weights, which is represented as 8+7+8+8+9=40.

    Original Description:

    Original Title

    Minimum Spanning Tree.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document presents a minimal spanning tree problem represented by a graph with 12 nodes connected by weighted edges. The solution finds the minimum total distance by connecting all nodes using the edges with the lowest weights, which is represented as 8+7+8+8+9=40.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views1 page

    Minimum Spanning Tree

    Uploaded by

    Romel Bucaloy
    This document presents a minimal spanning tree problem represented by a graph with 12 nodes connected by weighted edges. The solution finds the minimum total distance by connecting all nodes using the edges with the lowest weights, which is represented as 8+7+8+8+9=40.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Bucaloy, Romel B.

    BSA Block 28

    Minimal Spanning Tree Problem

    10
    2 4
    11
    12

    7 9
    8 6
    1
    9

    8
    3 8 5

    8+7+8+8+9= 40- Minimum Distance

    You might also like