Kruskal’s Algo

Published in

翛然野叟

1 min readFeb 18, 2019

--

greedy

時間複雜度: O(ElogE)

Step:

依照權重排序
選擇較小的邊，並檢查是否有環

EX:

MurkyPig

Written by MurkyPig

Editor for

翛然野叟

Always try something different~

Help
Status
About
Careers
Press
Blog
Privacy
Terms
Text to speech
Teams