Kruskal's algorithm is a minimum-spanning-tree algorithm where the algorithm finds an edge of the least possible weight that connects any two trees in the forest.It is a greedy algorithm in graph theory as it finds a minimum spanning tree for a connected weighted graph at each step.
== برنامهٔ Graph Explorer ==http://www.programyar.com/?p=5183%7B%7Bسخ}}== مثال ==== اثبات ==ثابت می‌کنیم هر درخت فراگیر formula_12 با یال‌های formula_13 که با الگوریتم کراسکال ساخته شود یک درخت بهینه‌است.