Node
ME->Node);
uint16_t Node;
Node *find_node(u_int32_t addr, Node **ptr)
Node *n = *ptr;
*ptr = n = (Node *) malloc(sizeof(Node));
Interface *find_interface(u_int32_t addr, Node *node)
Neighbor *find_neighbor(u_int32_t addr, Node *node)
Node *node = find_node(src, &routers);
Node *ifc_node;
Node *tmp = ifc_node->u.alias;
Node *n_node;
Node *node = find_node(src, &routers);
Node *ifc_node;
Node *tmp = ifc_node->u.alias;
Node *n_node;
int retry_requests(Node *node)
void print_map(Node *node)
void graph_edges(Node *node)
Node *nb_node = find_node(nb->addr, &routers);
void elide_aliases(Node *node)
Node *nb_node = find_node(nb->addr, &routers);
Node *routers = 0;
Node * find_node(u_int32_t addr, Node **ptr);
Interface * find_interface(u_int32_t addr, Node *node);
Node *n = find_node(target_addr, &routers);
Neighbor * find_neighbor(u_int32_t addr, Node *node);
int retry_requests(Node *node);
void print_map(Node *node);
void graph_edges(Node *node);
void elide_aliases(Node *node);