Cross Reference: /inkscape/src/libavoid/makepath.cpp

Lines Matching defs:Node
407     ANode Node, BestNode;           // Temporary Node and BestNode
436             Node = ANode(curr, timestamp++);
439                 Node.g = 0;
440                 Node.h = estimatedCost(lineRef, NULL, Node.inf->point, 
442                 Node.f = Node.g + Node.h;
448                 Node.g = BestNode.g + cost(lineRef, edgeDist, BestNode.inf, 
449                         Node.inf, DONE, BestNode.prevIndex);
452                 Node.h = estimatedCost(lineRef, &(BestNode.inf->point),
453                         Node.inf->point, tar->point);
456                 Node.f = Node.g + Node.h;
459                 Node.prevIndex = DONE.size() - 1;
464                 BestNode = Node;
470                 PENDING.push_back(Node);
480         Node = ANode(src, timestamp++);
481         Node.g = 0;
482         Node.h = estimatedCost(lineRef, NULL, Node.inf->point, tar->point);
483         Node.f = Node.g + Node.h;
487         PENDING.push_back(Node);
498         // Set the Node with lowest f value to BESTNODE.
615             Node = ANode((*edge)->otherVert(BestNode.inf), timestamp++);
619             Node.prevIndex = DONE.size() - 1;
622             if (!(Node.inf->id.isShape) && (Node.inf != tar))
631             if (prevInf && (prevInf == Node.inf))
645                   (validateBendPoint(prevInf, BestNode.inf, Node.inf) == false))
654             Node.g = BestNode.g + cost(lineRef, edgeDist, BestNode.inf, 
655                     Node.inf, DONE, BestNode.prevIndex);
658             Node.h = estimatedCost(lineRef, &(BestNode.inf->point),
659                     Node.inf->point, tar->point);
662             Node.f = Node.g + Node.h;
665             db_printf("-- Adding: %g %g  ", Node.inf->point.x, 
666                     Node.inf->point.y);
667             Node.inf->id.db_print();
668             db_printf(" - g: %3.1f h: %3.1f \n", Node.g, Node.h);
677                 if ((Node.inf == ati.inf) &&
678                         (DONE[Node.prevIndex].inf == DONE[ati.prevIndex].inf))
681                     if (Node.g < ati.g)
683                         PENDING[i] = Node;
691             if (!bNodeFound ) // If Node NOT found on PENDING
697                     if ((Node.inf == ati.inf) && 
698                             (DONE[Node.prevIndex].inf == DONE[ati.prevIndex].inf))
701                         if (Node.g < ati.g)
703                             DONE[i] = Node;
711             if (!bNodeFound ) // If Node NOT found on PENDING or DONE
714                 PENDING.push_back(Node);