CSC263H1 Lecture Notes - Lecture 11: Glossary Of Graph Theory Terms
Document Summary
Therefore it will of e graph connected contain an from g. V e but only some connected undirected graph gcv e. T ce tree of spanning the original graph is a tree a graph is not unique then it only has. 13 the min spanning tree edge in also in t but not t i o. Greed mst g v e k t is. I find e a safe edge for c. Kruskal"s algorithm iteratively find the lightest edge that component connects 2 distinct n t. T for an ei e e it ei has endpoint in v and endpoinettet in v then consider ei pick the e with smartest weight. O io i re sont edges wce e w cen e wces initialize components for each vertex vie v. D makeset vi from lightest edge to heaviest if. O: o notunique unique holds them unique.
