|
|
| Line 1: |
Line 1: |
| [[Category:Graph Algorithms]] | | See [[http://huffmann.algo.informatik.tu-darmstadt.de/wiki/wiki.algo.informatik.tu-darmstadt.de/index.php/Kruskal_for_maximum_spanning_forest.html here]]. |
| [[Category:Minimal Spanning Tree]]
| |
| <div class="plainlinks" style="float:right;margin:0 0 5px 5px; border:1px solid #AAAAAA; width:auto; padding:1em; margin: 0px 0px 1em 1em;">
| |
| <div style="font-size: 1.8em;font-weight:bold;text-align: center;margin:0.2em 0 1em 0">Kruskal</div>
| |
| | |
| <div style="font-size: 1.2em; margin:.5em 0 1em 0; text-align:center">whatever</div>
| |
| | |
| <div style="font-size: 1.2em; margin:.5em 0 .5em 0;text-align:center">[[File:olw_logo1.png|20px]][https://openlearnware.tu-darmstadt.de/#!/resource/kruskal-2430 Openlearnware]</div>
| |
| </div>
| |
| == General Information ==
| |
| '''Algorithmic problem:''' [[Minimum spanning tree]]
| |
| '''Prerequisites:'''
| |
| '''Type of algortihm: '''
| |
| '''Auxiliary data:'''
| |
|
| |
| == Abstract View ==
| |
| | |
| == Induction Basis ==
| |
| | |
| == Induction Step ==
| |
| | |
| == Pseudocode ==
| |
| | |
| == Complexity ==
| |