EntityQ1468211· pop 18· linked from 152 articlesBorůvka's algorithmSign in to savealgorithm 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 forestConnectionsBellman–Ford algorithmEntitydigital object identifierEntityMoraviaEntityparallel computingEntityelectrical gridEntityDijkstra's algorithmEntityJan ŁukasiewiczEntitydepth-first searchEntitybreadth-first searchEntityHugo SteinhausEntitybig O notationEntitymemory addressEntityQ22908627Entityplanar graphEntitygreedy algorithmEntityPrim's algorithmEntityA* search algorithmEntityminimum spanning treeEntityKruskal's algorithmEntitytime complexityEntityCategoriesGraph algorithmsSpanning tree