🌐EnglishEnglishDeutschEspañolFrançaisItalianoNederlandsPolskiPortuguêsSvenskaTiếng ViệtРусскийالعربيةفارسیไทย한국어中文日本語EntityQ797860· pop 31· linked from 165 articlesKruskal's algorithmminimum spanning forest algorithm that greedily adds edgesWikidata factsImageMST kruskal en.gifSources (2)wikidata.orgdocs.openalex.orgvia Wikidata · CC0Available in 30 languagesEspañolFrançaisDeutsch中文日本語РусскийPortuguêsItalianoالعربيةArmenianConnectionsBellman–Ford algorithmEntityAckermann functionEntityCategoriesGraph algorithmsGreedy algorithmsSpanning tree