ScienceBorůvka's algorithmOtakar BorůvkaAlgorithm for finding minimum spanning trees by repeatedly finding the shortest edge out of each subtree in a forest and adding all such edges to the forestRead on WikipediaEdit in BackendByOtakar BorůvkaMore to readBeyond inventionsSame vibe, elsewhereRelatedMore to readShow all (16)Kruskal's algorithmTextBellman–Ford algorithmTextAVL treeTextFloyd–Warshall algorithmTextBreadth-first searchTextAnt colony optimization algorithmsTextRed–black treeTextB-treeTextEulerian pathTextA* search algorithmTextLas Vegas algorithmTextDelaunay triangulationTextBinary search treeTextGraph theoryTextTrachtenberg systemTextMatroidTextAround thisBeyond inventionsShow all (16)🇸🇮The Fig TreeBook🇲🇩BorsFoodBotaniculaGame🇨🇿🇧🇾Alindarka's Children: Things Will Be BadBook🇸🇰Ever Green IsBookKontrabantGame🇸🇮🇱🇹Forest of the GodsBookBorschtFood🇭🇷Croatian Tales of Long AgoBook🇷🇺Borodinsky BreadFood🇸🇪BeartownBook🇱🇻Riga Black BalsamFood🇨🇿The Other CityBook🇸🇰Rivers of BabylonBook🇨🇿Czech BramborákFood🇲🇩Bessarabian StampsBookWorld tourSame vibe, elsewhereShow all (16)🇦🇷The Invention of MorelBook🇦🇹Geometric Regional NovelBook🇧🇬The Physics of SorrowBookBulánciGame🇨🇿AlternativaGame🇨🇿🇧🇪Chapel RoadBookMutation of J.B.Game🇸🇰🇷🇸The Tiger's WifeBook🇭🇺SkylarkBook🇨🇿BramborakyFood🇧🇳Almayer's FollyBook🇰🇷TowerBook🇧🇦Catch the RabbitBook🇭🇰Atlas: The Archaeology of an Imaginary CityBook🇨🇿Too Loud a SolitudeBookVe stínu havranaGame🇨🇿
