-/* Implementation of Kruskal's algorithm.
- Running time: O(E)
- Please note that sorting on weight is already done by add_edge().
-*/
-
-static void mst_kruskal(void) {
- /* Clear MST status on connections */
-
- for list_each(connection_t, c, connection_list)
- c->status.mst = false;
-
- logger(DEBUG_SCARY_THINGS, LOG_DEBUG, "Running Kruskal's algorithm:");
-
- /* Clear visited status on nodes */
-
- for splay_each(node_t, n, node_tree)
- n->status.visited = false;
-
- /* Add safe edges */
-
- for splay_each(edge_t, e, edge_weight_tree) {
- if(!e->reverse || (e->from->status.visited && e->to->status.visited))
- continue;
-
- e->from->status.visited = true;
- e->to->status.visited = true;
-
- if(e->connection)
- e->connection->status.mst = true;
-
- if(e->reverse->connection)
- e->reverse->connection->status.mst = true;
-
- logger(DEBUG_SCARY_THINGS, LOG_DEBUG, " Adding edge %s - %s weight %d", e->from->name,
- e->to->name, e->weight);
- }
-}
-