Searched refs:pLists2 (Results 1 – 2 of 2) sorted by relevance
226 Nwk_ManGraphListAdd( p, p->pLists2 + NWK_MAX_LIST, pVertex ); in Nwk_ManGraphListInsert()228 Nwk_ManGraphListAdd( p, p->pLists2 + pVertex->nEdges, pVertex ); in Nwk_ManGraphListInsert()259 Nwk_ManGraphListDelete( p, p->pLists2 + NWK_MAX_LIST, pVertex ); in Nwk_ManGraphListExtract()416 assert( p->pLists2[0] == 0 ); in Nwk_ManGraphCheckLists()417 assert( p->pLists2[1] == 0 ); in Nwk_ManGraphCheckLists()419 if ( p->pLists2[j] ) in Nwk_ManGraphCheckLists()421 pVertex = p->pVerts[ p->pLists2[j] ]; in Nwk_ManGraphCheckLists()644 assert( p->pLists2[0] == 0 ); in Nwk_ManGraphSolve()645 assert( p->pLists2[1] == 0 ); in Nwk_ManGraphSolve()647 if ( p->pLists2[j] ) in Nwk_ManGraphSolve()[all …]
96 int pLists2[NWK_MAX_LIST+1]; // lists of nodes with more than one edge member