Scribd
Upload
52 views8 pages

D1 Minimum Spanning Tree Notes

A minimum spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. Algorithms like Prim's algorithm and Kruskal's algorithm can be used to find the minimum spanning tree of a graph by adding edges in order of their weight while avoiding cycles.

Uploaded by

Sam Hnatiuk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
52 views8 pages

D1 Minimum Spanning Tree Notes

A minimum spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. Algorithms like Prim's algorithm and Kruskal's algorithm can be used to find the minimum spanning tree of a graph by adding edges in order of their weight while avoiding cycles.

Uploaded by

Sam Hnatiuk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Decision 1 Minimum Spanning Tree Questions

Decision 1 Minimum Spanning Trees Answers

You might also like