along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
- $Id: graph.c,v 1.1.2.27 2003/07/22 20:55:19 guus Exp $
+ $Id: graph.c,v 1.1.2.29 2003/08/28 21:05:10 guus Exp $
*/
/* We need to generate two trees from the graph:
/* Clear MST status on connections */
for(node = connection_tree->head; node; node = node->next) {
- c = (connection_t *) node->data;
+ c = node->data;
c->status.mst = false;
}
/* Clear visited status on nodes */
for(node = node_tree->head; node; node = node->next) {
- n = (node_t *) node->data;
+ n = node->data;
n->status.visited = false;
nodes++;
}
for(skipped = false, node = edge_weight_tree->head; node; node = next) {
next = node->next;
- e = (edge_t *) node->data;
+ e = node->data;
if(!e->reverse || e->from->status.visited == e->to->status.visited) {
skipped = true;
/* Clear visited status on nodes */
for(node = node_tree->head; node; node = node->next) {
- n = (node_t *) node->data;
+ n = node->data;
n->status.visited = false;
n->status.indirect = true;
}
while(todo_tree->head) {
for(from = todo_tree->head; from; from = next) { /* "from" is the node from which we start */
next = from->next;
- n = (node_t *) from->data;
+ n = from->data;
for(to = n->edge_tree->head; to; to = to->next) { /* "to" is the edge connected to "from" */
- e = (edge_t *) to->data;
+ e = to->data;
if(!e->reverse)
continue;
if(sockaddrcmp(&e->to->address, &e->address)) {
node = avl_unlink(node_udp_tree, e->to);
- e->to->address = e->address;
+ sockaddrfree(&e->to->address);
+ sockaddrcpy(&e->to->address, &e->address);
if(e->to->hostname)
free(e->to->hostname);
for(node = node_tree->head; node; node = next) {
next = node->next;
- n = (node_t *) node->data;
+ n = node->data;
if(n->status.visited != n->status.reachable) {
n->status.reachable = !n->status.reachable;