Lines Matching refs:adjedges

49 …HEAD_ADJ*             adjedges;           /**< pointer to first and one after last adjacent edge o…  member
189 (*tcliquegraph)->adjedges = NULL; in tcliqueCreate()
210 if ( (*tcliquegraph)->adjedges != NULL ) in tcliqueFree()
212 BMSfreeMemoryArray(&(*tcliquegraph)->adjedges); in tcliqueFree()
304 ALLOC_FALSE( BMSreallocMemoryArray(&tcliquegraph->adjedges, newsize) ); in tcliqueEnsureSizeNodes()
310 tcliquegraph->adjedges[i].first = tcliquegraph->nedges; in tcliqueEnsureSizeNodes()
311 tcliquegraph->adjedges[i].last = tcliquegraph->nedges; in tcliqueEnsureSizeNodes()
345 assert(tcliquegraph->adjedges[node].first <= tcliquegraph->nedges); in tcliqueAddNode()
346 assert(tcliquegraph->adjedges[node].last == tcliquegraph->adjedges[node].first); in tcliqueAddNode()
426 assert(tcliquegraph->adjedges != NULL); in tcliqueFlush()
436 …assert(tcliquegraph->adjedges[n].last - tcliquegraph->adjedges[n].first == tcliquegraph->degrees[n… in tcliqueFlush()
451 … for( i = tcliquegraph->adjedges[n].last - 1; i >= tcliquegraph->adjedges[n].first; --i, --pos ) in tcliqueFlush()
458 tcliquegraph->adjedges[n].first = pos+1; in tcliqueFlush()
459 tcliquegraph->adjedges[n].last = pos+1 + olddegree; in tcliqueFlush()
462 …|| tcliquegraph->adjedges[n].first + tcliquegraph->degrees[n] == tcliquegraph->adjedges[n+1].first… in tcliqueFlush()
465 assert(tcliquegraph->adjedges[n].last == pos+1); in tcliqueFlush()
480 … assert(tcliquegraph->adjedges[n].last <= tcliquegraph->nedges + tcliquegraph->ncachededges); in tcliqueFlush()
481 …assert(n == tcliquegraph->nnodes-1 || tcliquegraph->adjedges[n].last <= tcliquegraph->adjedges[n+1… in tcliqueFlush()
483 …|| tcliquegraph->adjedges[n].first + tcliquegraph->degrees[n] == tcliquegraph->adjedges[n+1].first… in tcliqueFlush()
486 for( pos = tcliquegraph->adjedges[n].last; in tcliqueFlush()
487 pos > tcliquegraph->adjedges[n].first && dest < tcliquegraph->adjnodes[pos-1]; --pos ) in tcliqueFlush()
492 tcliquegraph->adjedges[n].last++; in tcliqueFlush()
494 …assert(n == tcliquegraph->nnodes-1 || tcliquegraph->adjedges[n].last <= tcliquegraph->adjedges[n+1… in tcliqueFlush()
526 assert(tcliquegraph->adjedges[n].first == pos); in tcliqueFlush()
527 …assert(tcliquegraph->adjedges[n].last == tcliquegraph->adjedges[n].first + tcliquegraph->degrees[n… in tcliqueFlush()
529 for( i = tcliquegraph->adjedges[n].first; i < tcliquegraph->adjedges[n].last-1; ++i ) in tcliqueFlush()
533 pos = tcliquegraph->adjedges[n].last; in tcliqueFlush()
650 if( BMSallocMemoryArray(&(*tcliquegraph)->adjedges, (*tcliquegraph)->nnodes) == NULL ) in tcliqueLoadFile()
701 (*tcliquegraph)->adjedges[currentnode].first = i; in tcliqueLoadFile()
702 (*tcliquegraph)->adjedges[currentnode].last = (*tcliquegraph)->adjedges[currentnode].first; in tcliqueLoadFile()
706 (*tcliquegraph)->adjedges[currentnode].last++; in tcliqueLoadFile()
749 for( j = tcliquegraph->adjedges[i].first; j < tcliquegraph->adjedges[i].last; j++ ) in tcliqueSaveFile()
797 HEAD_ADJ* adjedges; in tcliqueGetFirstAdjedge() local
804 adjedges = tcliquegraph->adjedges; in tcliqueGetFirstAdjedge()
805 assert(adjedges != NULL); in tcliqueGetFirstAdjedge()
806 assert(adjedges[node].first >= 0); in tcliqueGetFirstAdjedge()
807 assert(adjedges[node].first <= tcliqueGetNEdges(tcliquegraph)); in tcliqueGetFirstAdjedge()
812 return &adjnodes[adjedges[node].first]; in tcliqueGetFirstAdjedge()
821 HEAD_ADJ* adjedges; in tcliqueGetLastAdjedge() local
831 adjedges = tcliquegraph->adjedges; in tcliqueGetLastAdjedge()
835 assert(adjedges != NULL); in tcliqueGetLastAdjedge()
836 assert(degrees[node] == 0 || adjedges[node].last-1 >= 0); in tcliqueGetLastAdjedge()
837 assert(adjedges[node].last-1 <= tcliqueGetNEdges(tcliquegraph)); in tcliqueGetLastAdjedge()
839 assert(adjedges[node].last - adjedges[node].first == degrees[node]); in tcliqueGetLastAdjedge()
844 return &adjnodes[adjedges[node].last-1]; in tcliqueGetLastAdjedge()