Home›Dynamic programming›플로이드-워셜 알고리즘🌐한국어EnglishBahasa IndonesiaDeutschEspañolFrançaisItalianoNederlandsPolskiPortuguêsTiếng ViệtTürkçeРусскийالعربيةفارسیไทย한국어中文日本語EntityQ1047576· pop 24· linked from 171 articles플로이드-워셜 알고리즘Also known as Warshall–Floyd Algorithm그래프에서 모든 꼭짓점 간의 최단경로를 찾는 알고리즘, 음수 가중치를 허용한다Wikidata factsImageFloyd-Warshall-Algorithm-Problem.pngSources (3)wikidata.orgdocs.openalex.orgweb.archive.orgvia Wikidata · CC0Available in 23 languagesEspañolFrançaisDeutsch中文日本語РусскийPortuguêsItalianoالعربيةBahasa IndonesiaConnectionsBellman–Ford algorithmEntitymathematical optimizationEntityCategoriesDynamic programmingGraph algorithmsGraph distancePolynomial-time problemsRouting algorithms