นไม, แบบทอดข, ามน, อยส, ดแบบย, คล, นไม, ทอดข, ามท, อยท, ดแบบย, คล, หร, นไม, แผ, วท, อยท, ดแบบย, คล, งกฤษ, euclidean, minimum, spanning, tree, เป, นป, ญหาทางทฤษฎ, กราฟเก, ยวก, บการหาต, นไม, ทอดข, ามท, อยท, ดบนระนาบแบบย, คล, หร, อก, อว, เช, อมโยงจ, ดต, าง, บนระน. tnimthxdkhamthinxythisudaebbyukhlid hrux tnimaephthwthinxythisudaebbyukhlid xngkvs Euclidean minimum spanning tree epnpyhathangthvsdikrafekiywkbkarhatnimthxdkhamthinxythisudbnranabaebbyukhlid hruxkkhuxwithiechuxmoyngcudtang bnranabsxngmiti ihepntnimaelamirayathangrwmrahwangcudtang nxythisud odymxngcudtang epncudyxdaela rayathangrahwangcudyxdepnesnechuxmtnimaebbthxdkhamelksudkhxngyukhlid thimicud 25 cud inranab enuxha 1 khntxnwithiinkarkhanwntnimthxdkhamthinxythisudaebbyukhlid 2 khnadthikhadhwng 3 xangxing 4 duephimkhntxnwithiinkarkhanwntnimthxdkhamthinxythisudaebbyukhlid aekikhkhntxnwithithingaythisudinkarkhanwntnimthxdkhamthinxythisudaebbyukhlid emuxmicudthnghmd n cud thakrafepnkrafaebbbriburnthimicudyxd n cud camiesnechuxm n n 1 2 esn khanwnnahnkkhxngesnechuxmaetlaesndwykarharayahangrahwangkhucudyxdnn aelwcungichkhntxnwithiaebbphunthaninkarkhanwntnimaebbthxdkhamelksud echn khntxnwithikhxngphrim xngkvs Prim s Algorithm hrux khntxnwithikhxngkhruskal Archived 2010 11 16 thi ewyaebkaemchchin xngkvs Kruskal s algorithm aetthakrafepnkrafid thimicudyxd n cud aelamiesnechuxm 8 n2 esn eracatxngkarewla W n2 aelaichphunthi W n2 inkarekbesnechuxmthukesninkrafwithithidikwainkarkhanwntnimthxdkhamthinxythisudaebbyukhlid khux karaebngestcakdkhxngcudbnranab ihepnestkhxngsamehliymedxlneny khanwnsamehliymedxlneny sungcaichewlaephiyng O n log n aelaichphunthiephiyng O n enuxngcaksamehliymedxlnenyepnkrafechingranab aebngaetlaesnechuxmdwykhwamyaw daeninkartamkhntxnwithibnkrafni ephuxhatnimaebbthxdkhamelksud emuxmiesnechuxm O n esn caichewla O n log n inkarichkhntxnwithiaebbphunthaninkarkhanwntnimaebbthxdkhamelksud echn khntxnwithikhxngobrufka xngkvs Boruvka s algorithm khntxnwithikhxngphrim hrux khntxnwithikhxngkhruskalsudthayaelw khntxnwithinicaichewlaepn O n log n aelaichphunthiepn O n khnadthikhadhwng aekikhkhnadthikhadhwngkhxngtnimthxdkhamthinxythisudaebbyukhlid sahrbcudcanwnmak thukkhnkhwaody ec imekhil stilel klawwa tha f epnfngkchnkhwamhnaaennkhxngkhwamnacaepnkhxngcudthicathukeluxk aelw n displaystyle n khnadid aela d 1 displaystyle d neq 1 khnadkhxngtnimthxdkhamthinxythisudaebbyukhlidcapramanidwa c d n d 1 d R d f x d 1 d d x displaystyle c d n frac d 1 d int mathbb R d f x frac d 1 d dx emux c d displaystyle c d khux khakhngthithikhunkb d displaystyle d sungeraimthrabkhathiaennxnkhxngkhakhngthini aetsamarthpramanidcakhlkthankarthdlxngxangxing aekikhEppstein David 1999 Spanning trees and spanners in Sack J R Urrutia J b k Handbook of Computational Geometry Elsevier pp 425 461Mares Martin 2004 Two linear time algorithms for MST on minor closed graph classes PDF Archivum mathematicum 40 3 315 320duephim aekikhtnim thvsdikraf tnimthxdkham ranabekhathungcak https th wikipedia org w index php title tnimaebbthxdkhamnxysudaebbyukhlid amp oldid 9644195, wikipedia, วิกิ หนังสือ, หนังสือ, ห้องสมุด,
