Home›Polynomial-time problems›最小全域木🌐日本語EnglishBahasa IndonesiaDeutschEspañolFrançaisItalianoNederlandsPolskiPortuguêsSvenskaTiếng ViệtРусскийالعربيةفارسیไทย한국어中文日本語EntityQ240464· pop 32· linked from 244 articles最小全域木Also known as MST, shortest spanning tree, SSTdata structure, subgraph of a weighted graphWikidata factsImageMin udsaend trae.svgSources (3)wikidata.orgdocs.openalex.orgweb.archive.orgvia Wikidata · CC0Available in 30 languagesEspañolFrançaisDeutsch中文РусскийPortuguêsItalianoالعربيةArmenianConnectionsreductio ad absurdumEntityInternational Standard Book NumberEntityCategoriesPolynomial-time problemsSpanning tree