Diskussion:Heuristics: Minimal Spanning Tree 1

Hi groupe 1,

Your theoretical introduction is shortly and precisely written. In contrast to our group you started with a short definition of a general spanning tree, which helps to understand the initial problem. You put a lot more information in the wiki entry as there is in the german article. This makes it better understandable but maybe too much to read if you want to get just a short overlook of the topic. In my opinion its good to explain it a little bit longer like this so people without any knowledge about the topic can follow too.

Your two algorithms are correct and rather comprehensible. From my point of view the graphs you designed to illustrate the realized steps of the algorithm are a little confusing, because you kept the whole graph with all edges and costs in any step.

But still it is correct though. Good job.