So this is our last week before IOI (www.ioi2010.org). Its going to be crazy..i have to be with the contestants here at the Centre and also finish up stuff at Legon.
Right now, i'm preparing a review of Kruskal and Prim's algorithm. They perform the same job. But they are just a bit different in implementing. What they do is to find the minimum spanning tree in a graph. A spanning tree is a subgraph which contains all the nodes in a graph, with no cycle. A minimum spanning tree has, in addition to the properties of a spanning tree, the least total weight of all the edges in the graph.
So we apply Kruskal's or Prim's when we want to minimize cost but visit every node or vertice.
Just so you know!..:)
You are a real "shark".I am trying hard to understand these and you are explaining so well.
ReplyDeletelol...Jonathan you are also a shark. Its just a matter of time and practice. I'm writing a review on all the algorithms we've talked about. So this will be the last thing we do. And after, I'll leave you to your own devices...:)
ReplyDelete