Scribd
Upload
21 views1 page

Minimum Spanning Tree

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.

Uploaded by

Romel Bucaloy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
21 views1 page

Minimum Spanning Tree

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.

Uploaded by

Romel Bucaloy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 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