static void mst_kruskal(void) {
/* Clear MST status on connections */
- for list_each(connection_t, c, connection_list)
+ for list_each(connection_t, c, mesh->connections)
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)
+ for splay_each(node_t, n, mesh->nodes)
n->status.visited = false;
/* Starting point */
- for splay_each(edge_t, e, edge_weight_tree) {
+ for splay_each(edge_t, e, mesh->edges) {
if(e->from->status.reachable) {
e->from->status.visited = true;
break;
bool skipped = false;
- for splay_each(edge_t, e, edge_weight_tree) {
+ for splay_each(edge_t, e, mesh->edges) {
if(!e->reverse || (e->from->status.visited == e->to->status.visited)) {
skipped = true;
continue;
if(skipped) {
skipped = false;
- next = edge_weight_tree->head;
+ next = mesh->edges->head;
}
}
}
/* Clear visited status on nodes */
- for splay_each(node_t, n, node_tree) {
+ for splay_each(node_t, n, mesh->nodes) {
n->status.visited = false;
n->status.indirect = true;
n->distance = -1;
static void check_reachability(void) {
/* Check reachability status. */
- for splay_each(node_t, n, node_tree) {
+ for splay_each(node_t, n, mesh->nodes) {
if(n->status.visited != n->status.reachable) {
n->status.reachable = !n->status.reachable;
n->last_state_change = now.tv_sec;