base spanning tree mentions: still need actual content
This commit is contained in:
parent
f93153cdb0
commit
80eae13431
19
370/notes/spanning-tree.md
Normal file
19
370/notes/spanning-tree.md
Normal file
@ -0,0 +1,19 @@
|
|||||||
|
# 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
|
||||||
|
|
Loading…
Reference in New Issue
Block a user