T = graph consisting of V with no edges while T has < n-1 edges do for each connected component C of T do e = min cost edge (v,u) s.t. v in C and u not in CT := T union {e}
↑ เอกสารประกอบคำสอนขั้นตอนวิธีโบรุฟกา ของ University of California Irvine
เอกสารประกอบคำสอนขั้นตอนวิธีโบรุฟกา ของ University of Texas at Austin
Boruvka's algorithm Articles and Information
สิงหาคม 08, 2021
นตอนว, ของโบร, ฟกา, งก, ามภาษา, ในบทความน, ไว, ให, านและผ, วมแก, ไขบทความศ, กษาเพ, มเต, มโดยสะดวก, เน, องจากว, เด, ยภาษาไทยย, งไม, บทความด, งกล, าว, กระน, ควรร, บสร, างเป, นบทความโดยเร, วท, ดข, นตอนว, โบร, ฟกา, งกฤษ, borůvka, algorithm, อข, นตอนว, สำหร, บหาต, . lingkkhamphasa inbthkhwamni miiwihphuxanaelaphurwmaekikhbthkhwamsuksaephimetimodysadwk enuxngcakwikiphiediyphasaithyyngimmibthkhwamdngklaw krann khwrribsrangepnbthkhwamodyerwthisudkhntxnwithiobrufka xngkvs Boruvka s algorithm khuxkhntxnwithisahrbhatnimthxdkhamnxythisudinkrafthithukesnechuxmminahnkimethakn enuxha 1 prawtithima 2 enuxha 3 okhrngsrangkhxmul 4 rhsethiym 4 1 karwiekhraahrhsethiym 5 khntxnwithixunthiaekikhpyhaediywkn 6 xangxingprawtithima aekikhthvstiniidcahnaykhuninpi kh s 1962 ody Otakar Boruvka ephuxepnwithikarsahrbsrangokhrngkhayiffathimiprasiththiphaphsahrb ekhtmxerewiy isliesiy emuxngxxstrawa in satharnrthechk hlngcaknnkhntxnwithiniidthukkhnphbxikkhrngody Florek Lukasiewicz Perkal Steinhaus aela Zubrzycki inpi kh s 1951 aelakhnphbody Sollin inpi kh s 1965 enuxngcakwa Sollin epnnkwithyasastrkhxmphiwetxrephiyngkhnediywinthiklawmakhangtnxasyxyuinpraethsthiichphasaxngkvsepnphasapracachati khntxnwithinicungmkthukeriykinxikchuxhnungwa khntxnwithiosllinenuxha aekikh khntxnwithinithuxwaepnkhntxnwithiaebblaomb erimtncakkarphicarnacudyxdthilacudaelathakareluxkesnechuxmthiechuxmcudyxdnnaelacudyxdidthiminahnknxythisudaelaimthaihekidwtckrodyimkhanungwaesnechuxmnnidthukeluxkipaelw thaechnniiperuxycnkwa cudechuxmthukcudcaklayepn tnimthxdkhamokhrngsrangkhxmul aekikhokhrngsrangkhxmulthisakhysahrbkhntxnwithiobrufka khux krafthicaichtxngepnkrafaebbimmithisthang 1 rhsethiym aekikhGiven G V E T graph consisting of V with no edges while T has lt n 1 edges do for each connected component C of T do e min cost edge v u s t v in C and u not in C T T union e 2 karwiekhraahrhsethiym aekikh inaetlakarwnkhxngwngwnnn txng ha connected component sungsamarthhaidinewla O E V displaystyle O E V odyichkarkhnaebbcakdkhwamluk haesnechuxmthisnthisud samarthhaidinewla O E displaystyle O E odykarepriybethiyb thukesnechuxmkhxng v displaystyle v aela u displaystyle u kbesnechuxmthisudthisudkhxng v displaystyle v aelaesnechuxmthisnthisudchxng u displaystyle u canwnkhxng connected component caldlngodypraman 2 ethatxkarwnhnungrxb dngnncungsamarththrabidwamikarwnmakthisud l o g V displaystyle log V khrng dngnn ewlathiichthnghmdcungepn O E l o g V displaystyle O E log V 1 khntxnwithixunthiaekikhpyhaediywkn aekikhkhntxnwithisahrbhatnimthxdkhamnxythisud nxkcakkhntxnwithiniaelwyngrwmipdwykhntxnwithikhruskalaelakhntxnwithiphrim sahrbkhntxnwithithierwkwann samarthkhanwnidodykhntxnwithiaebbsum aelaichkhntxnwithiphrimaelakhntxnwithiobrufkarwmkn sungcasamarthkhanwnidinewla O E displaystyle O E 3 sahrbkhntxnwithiechingkahndthierwthisudkichkhntxnwithiobrufkarwmdwy miewlakarthangan O E a E V displaystyle O E alpha E V ody a displaystyle alpha epnfngkchnphkphnkhxngfngkchnaexkhekhxraemnxangxing aekikh 1 0 1 1 exksarprakxbkhasxnkhntxnwithiobrufka khxng University of California Irvine exksarprakxbkhasxnkhntxnwithiobrufka khxng University of Texas at Austin Boruvka s algorithm Articles and Informationekhathungcak https th wikipedia org w index php title khntxnwithikhxngobrufka amp oldid 6729018, wikipedia, วิกิ หนังสือ, หนังสือ, ห้องสมุด,
