csnotes/370/notes/spanning-tree.md

Spanning tree

Graph in a graph where all nodes are connected but there are

1. no cycles

2. |V-1| edges

Minimum

total edge weight minimized

Things needed for next two sections:

time complexity

space complexity

Kruskal

Prim