Category:Borůvka's algorithm
Jump to navigation
Jump to search
algorithm 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 forest | |||||
Upload media | |||||
Instance of | |||||
---|---|---|---|---|---|
Named after | |||||
Discoverer or inventor | |||||
Publication date |
| ||||
| |||||
Media in category "Borůvka's algorithm"
The following 11 files are in this category, out of 11 total.
-
Boruvka Step 1.svg 618 × 518; 18 KB
-
Boruvka Step 2.svg 744 × 600; 18 KB
-
Boruvka Step 3.svg 744 × 600; 15 KB
-
Boruvka Step 4.svg 744 × 600; 13 KB
-
Boruvka Step 5.svg 744 × 600; 11 KB
-
Boruvka's algorithm (Sollin's algorithm) Anim.gif 1,198 × 673; 479 KB
-
Boruvka's-algorithm-example.gif 500 × 300; 54 KB
-
Boruvka-example2.gif 500 × 300; 127 KB
-
Borůvka Algorithm 1.svg 616 × 522; 19 KB
-
Borůvka Algorithm 2.svg 616 × 522; 23 KB
-
Borůvka Algorithm 3.svg 616 × 540; 18 KB