41
Minimum Spanning Trees
(cont)
Simplifying assumption:
edges in
G
are not directed
(MST for digraphs is harder)
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}