☆1.Prim' s algorithms &o Let t=e where e is minimum-weighted edge in G ◆fori=lton-2 &o begin e an edge of minimum weight incident to a vertex in T and not forming a simple circuit in T if added to T 令T:=TU{e end❖ 1.Prim’s algorithms ❖ Let T={e} where e is minimum-weighted edge in G ❖ for i=1 to n-2 ❖ begin ei= an edge of minimum weight incident to a vertex in T and not forming a simple circuit in T if added to T ❖ T:=T∪{ei } ❖ end