Lines Matching refs:NODE
90 #define _CV_IS_SITE_REFLEX( SITE ) ((SITE) ->node[0] == (SITE) ->node[1])
91 #define _CV_IS_EDGE_REFLEX( EDGE ) (( (EDGE)->site[0]->node[0] == (EDGE)->site[0]->node[0] ) || \
92 ( (EDGE)->site[1]->node[0] == (EDGE)->site[1]->node[0] ) )
94 #define _CV_INITIALIZE_CVLCMDATA(STRUCT,SITE,EDGE,NODE)\
95 { (STRUCT)->psite = SITE ; (STRUCT)->pedge = EDGE; (STRUCT)->pnode = NODE;}
112 // Purpose: Function constructs Complex Node (node, which consists of
119 // Returns: pointer to constructed node
129 // Purpose: Function constructs Simple Node (node, which consists of
136 // Returns: pointer to constructed node
165 // Returns: pointer to graph node
175 // given node and correspondent incident sites
179 // pNode : in, given node
196 // Purpose: Function create graph node
200 // Returns: pointer to graph node
220 // Purpose: Function establishs the connection between node and ege
223 // LCMNode : in, graph node
225 // LCMEdge_prev : in&out, previous edge, connected with given node
227 // i : =0, if node is initial for edge
228 // =1, if node is terminal for edge
372 if(pSite->node[0] == pSite->node[1])
474 CV_WRITE_SEQ_ELEM(pSite->node[1]->pt, writer);
646 if(pEdge_cur->node[0]->radius && pEdge_cur->node[1]->radius)
669 pLCMCCNData->site_first_pt = pLCMData->psite->node[0]->pt;
670 pLCMCCNData->site_last_pt = pLCMData->psite->node[0]->pt;
677 &pLCMCCNData->site_first->node[0]->pt,
678 &pLCMCCNData->site_first->node[1]->pt,
682 &pLCMCCNData->site_last->node[0]->pt,
683 &pLCMCCNData->site_last->node[1]->pt,
