priority queue with O(1) access to the minimum element
◆ SCIPpqueueCreate()creates priority queue
Definition at line 1298 of file misc.c.
References BMSallocMemory, MAX, NULL, pqueueResize(), SCIP_ALLOC, SCIP_CALL, and SCIP_OKAY.
Referenced by initData(), initProblem(), nodepairqueueCreate(), SCIPbendersActivate(), SCIPconflictCreate(), and subtreeSumGapStoreNode().
◆ SCIPpqueueFree() ◆ SCIPpqueueClear() ◆ SCIPpqueueInsert()inserts element into priority queue
Definition at line 1397 of file misc.c.
References SCIP_PQueue::len, NULL, PQ_PARENT, pqueueElemChgPos(), pqueueResize(), SCIP_CALL, SCIP_OKAY, and SCIP_PQueue::slots.
Referenced by conflictQueueBound(), createAndSplitProblem(), nodepairqueueCreate(), propagateVbounds(), SCIP_DECL_EVENTEXEC(), SCIPbendersActivate(), solveProblem(), subtreeSumGapStoreNode(), and updateSubproblemStatQueue().
◆ SCIPpqueueDelPos() void SCIPpqueueDelPos ( SCIP_PQUEUE * pqueue, int pos ) ◆ SCIPpqueueRemove() ◆ SCIPpqueueFirst() ◆ SCIPpqueueNElems()returns the number of elements in the queue
Definition at line 1530 of file misc.c.
References SCIP_PQueue::len, and NULL.
Referenced by conflictAddConflictset(), conflictAnalyze(), conflictCreateReconvergenceConss(), conflictFirstCand(), conflictRemoveCand(), conflictResolveBound(), createSolveSubproblemIndexList(), propagateVbounds(), SCIP_DECL_EVENTEXEC(), SCIPconflictAnalyze(), SCIPisPropagatedVbounds(), SCIPpqueueDelPos(), SCIPpqueueFind(), solveProblem(), subtreeSumGapDelSubtrees(), subtreeSumGapRemoveNode(), subtreeSumGapStoreNode(), and updateSubproblemStatQueue().
◆ SCIPpqueueElems() ◆ SCIPpqueueFind() int SCIPpqueueFind ( SCIP_PQUEUE * pqueue, void * elem )RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4