sourceinsight.searchresults

一个linux下的各种组播路由算法编程

---- nd1 Matches (69 in 5 files) ----
Node2.c:  Node *nd1, *nd2;
Node2.c:  nd1 = nodeOf(n1);
Node2.c:      AdjacencyListEntry *adj = nd1->adjacentNodes();
Node2.c:	d = distance(nd1, nd2);
Node2.c:	  nd1->addNeighbor(nd2, defaultCapacity);
Node2.c:	  nd2->addNeighbor(nd1, defaultCapacity);
Node2.c:      nd1 = nodeOf(n1);
Node2.c:	    d = distance(nd1, nd2);
Node2.c:	      nd1->addNeighbor(nd2, defaultCapacity);
Node2.c:	      nd2->addNeighbor(nd1, defaultCapacity);
Node2.c:	    AdjacencyListEntry *adj = nd1->adjacentNodes();
Node2.c:	      d = distance(nd1, nd2);
Node2.c:		nd1->addNeighbor(nd2, defaultCapacity);
Node2.c:		nd2->addNeighbor(nd1, defaultCapacity);
Node2.c:      nd1 = nodeOf(n1);
Node2.c:      AdjacencyListEntry *adj = nd1->adjacentNodes();
Node2.c:	d = distance(nd1, nd2);
Node2.c:	  nd1->addNeighbor(nd2, defaultCapacity);
Node2.c:	  nd2->addNeighbor(nd1, defaultCapacity);
Node2.c:  Node *nd1, *nd2;
Node2.c:  nd1 = nodeOf(n1);
Node2.c:      AdjacencyListEntry *adj = nd1->adjacentNodes();
Node2.c:	d = distance(nd1, nd2);
Node2.c:	  nd1->addNeighbor(nd2, defaultCapacity);
Node2.c:	  nd2->addNeighbor(nd1, defaultCapacity);
Node2.c:      nd1 = nodeOf(n1);
Node2.c:	    d = distance(nd1, nd2);
Node2.c:	      nd1->addNeighbor(nd2, defaultCapacity);
Node2.c:	      nd2->addNeighbor(nd1, defaultCapacity);
Node2.c:	    AdjacencyListEntry *adj = nd1->adjacentNodes();
Node2.c:	      d = distance(nd1, nd2);
Node2.c:		nd1->addNeighbor(nd2, defaultCapacity);
Node2.c:		nd2->addNeighbor(nd1, defaultCapacity);
Node2.c:      nd1 = nodeOf(n1);
Node2.c:      AdjacencyListEntry *adj = nd1->adjacentNodes();
Node2.c:	d = distance(nd1, nd2);
Node2.c:	  nd1->addNeighbor(nd2, defaultCapacity);
Node2.c:	  nd2->addNeighbor(nd1, defaultCapacity);
Node2.c:   Node *nd1, *nd2;
Node2.c:         nd1 = new Node(x, y);
Node2.c:         tmp->nodePtr(nd1);
Node2.c:         nd1->name(name);
Node2.c:         nd1 = tmp->nodePtr();
Node2.c:             nd1->addNeighbor(nd2, cap, pk, avg);
Node2.c:             nd1 = nodeOf(name);
Node2.c:             addMCDestination(nd1, addr);
Node2.c:         nd1 = nodeOf(name);
Node2.c:         nd1->addSource(model, type, priority, peak, avg_rho, burst, addr);
Node2.c:         nd1 = tmp->nodePtr();
Node2.c:             tmpRout->next(nd1->routingTable());
Node2.c:             nd1->routingTable(tmpRout);
Rout.c:      int found1 = False;
Rout.c:      while ((rout1 != NULL) && (found1 == False)) {
Rout.c:            found1 = True;
routCAO.c:  int nd1, nd2;
routCAO.c:      nd1 = *(waiting + i);
routCAO.c:      while ((*(p1 + j) != nd1) && (found == False)) {
routCAO.c:	      if (*(p2 + l) == nd1) found = True;
routCAO.c:      nd1 = nd2;
routCAO.c:    while (*(p1 +j) != nd1) j++;
routCAO.c:    while (*(p2 + l) != nd1) {
routCAO.c:    *(p1 + l) = nd1;
Sim.c:   Node *nd1, *nd2, *nd;
Sim.c:       case BACKGROUND1:
Sim.c:   flag = BACKGROUND1;
Sim.c:   flag = BACKGROUND1;
Sim.c:   flag = BACKGROUND1;
Sim.c:   flag = BACKGROUND1;
Sim.h:#define BACKGROUND1 30