---

External Memory Minimum Spanning Trees Compound Members

_ | a | b | c | d | e | f | g | h | i | k | m | n | o | p | r | s | t | u | w | ~

Here is a list of all documented class members with links to the classes they belong to:

- _ -

• _bijection : Randomizer< Bijection >
• _bottom : SparingStack< value_type, elementsPerBlock, noOfBlocks >
• _edges : DuplicatesRemover< SuperContainer >
• _elements : CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >::Block
• _extBuckets : Buckets< nodesPerBucket >
• _firstExtBucket : PQueue, Buckets< nodesPerBucket >
• _firstNodeIDofCurrentBucket : Buckets< nodesPerBucket >
• _graph : PQueue, Buckets< nodesPerBucket >, Kruskal< EdgeType >
• _hashMap : DuplicatesRemover< SuperContainer >
• _hashMapSize : DuplicatesRemover< SuperContainer >
• _height : Kruskal< EdgeType >
• _intBuckets : Buckets< nodesPerBucket >
• _maxSize : DuplicatesRemover< SuperContainer >
• _maxSqRoot : RandomizerFeistel
• _noOfIterations : RandomizerFeistel
• _noOfNodes : Randomizer< Bijection >
• _noOfNodesInIntMem : PQueue, Buckets< nodesPerBucket >
• _parent : Kruskal< EdgeType >
• _pool : SparingStack< value_type, elementsPerBlock, noOfBlocks >
• _pqueue : PQueue
• _prefetchPool : PQueue, Buckets< nodesPerBucket >
• _prev : CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >::Block
• _prime : RandomizerLinearCongruence
• _result : PQueue, Buckets< nodesPerBucket >, Kruskal< EdgeType >
• _size : CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >::Block, DuplicatesRemover< SuperContainer >
• _sqRoot : RandomizerFeistel
• _superContainer : DuplicatesRemover< SuperContainer >
• _top : SparingStack< value_type, elementsPerBlock, noOfBlocks >
• _writePool : PQueue, Buckets< nodesPerBucket >

- a -

• add() : PQueue, MST, Buckets< nodesPerBucket >
• addToExternalBucket() : Buckets< nodesPerBucket >

- b -

• Block : CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >::Block, SparingStack< value_type, elementsPerBlock, noOfBlocks >
• bucketID() : Buckets< nodesPerBucket >
• Buckets() : Buckets< nodesPerBucket >

- c -

• clear() : CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >::Block, DuplicatesRemover< SuperContainer >
• clearLocal() : DuplicatesRemover< SuperContainer >
• CommonPoolOfBlocks() : CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >
• computeMST() : Kruskal< EdgeType >

- d -

• determineMinEdge() : REWS_SparingStack< elementsPerBlock, noOfBlocks >
• determineNextPrime() : RandomizerLinearCongruence
• DuplicatesRemover() : DuplicatesRemover< SuperContainer >

- e -

• Edge() : Edge
• edgesAddedToResult : Kruskal< EdgeType >
• EdgesOfOneNode : Buckets< nodesPerBucket >
• EdgesOfSeveralNodes : Buckets< nodesPerBucket >
• EdgeVector() : EdgeVector< EdgeType, blockSize, noOfPages, pageSize >
• EdgeWithoutSource() : EdgeWithoutSource
• empty() : SparingStack< value_type, elementsPerBlock, noOfBlocks >, CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >::Block, EdgeVector< EdgeType, blockSize, noOfPages, pageSize >, DuplicatesRemover< SuperContainer >

- f -

• find() : DuplicatesRemover< SuperContainer >, Kruskal< EdgeType >
• full() : CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >::Block

- g -

• getIntMemBucket() : PQueue, Buckets< nodesPerBucket >

- h -

• hashFunction() : DuplicatesRemover< SuperContainer >
• HashMapElement : DuplicatesRemover< SuperContainer >

- i -

• increaseReserveMemory() : CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >
• initBuckets() : Buckets< nodesPerBucket >
• initPQueue() : PQueue
• initRandomNumbers() : RandomizerFeistel
• initUnionFind() : Kruskal< EdgeType >
• insert() : DuplicatesRemover< SuperContainer >
• isPrime() : RandomizerLinearCongruence
• isSelfLoop() : Edge

- k -

• key_type : Edge
• Kruskal() : Kruskal< EdgeType >

- m -

• maxWeight : RelabeledEdge, Edge, EdgeWithoutSource
• minWeight : RelabeledEdge, Edge, EdgeWithoutSource
• MST() : MST

- n -

• noOfEdges() : MST, EdgeVector< EdgeType, blockSize, noOfPages, pageSize >
• noOfExtBuckets() : Buckets< nodesPerBucket >
• noOfNodes() : EdgeVector< EdgeType, blockSize, noOfPages, pageSize >

- o -

• operator()() : RandomizerFeistel, RandomizerLinearCongruence
• operator< : EdgeWithoutSource
• operator<< : RelabeledEdge, RelabeledEdgeWithoutSource, MST, EdgeVector< EdgeType, blockSize, noOfPages, pageSize >, Edge, EdgeWithoutSource
• operator== : Edge, EdgeWithoutSource
• operator[]() : CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >::Block
• originalSource() : RelabeledEdge, RelabeledEdgeWithoutSource
• originalTarget() : RelabeledEdge, RelabeledEdgeWithoutSource

- p -

• Pool : SparingStack< value_type, elementsPerBlock, noOfBlocks >
• PoolEdgesOfOneNode : Buckets< nodesPerBucket >
• pop() : SparingStack< value_type, elementsPerBlock, noOfBlocks >, CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >::Block
• PQueue() : PQueue
• prevBlock() : CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >::Block
• PriorityQueue : PQueue
• push() : SparingStack< value_type, elementsPerBlock, noOfBlocks >, CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >::Block

- r -

• randomize() : Randomizer< Bijection >
• Randomizer() : Randomizer< Bijection >
• RandomizerFeistel() : RandomizerFeistel
• RandomizerLinearCongruence() : RandomizerLinearCongruence
• randomNumbers : RandomizerFeistel
• reduceNodes() : PQueue, Buckets< nodesPerBucket >
• RelabeledEdge() : RelabeledEdge
• RelabeledEdgeWithoutSource() : RelabeledEdgeWithoutSource
• release() : CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >
• request() : CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >

- s -

• setPool() : SparingStack< value_type, elementsPerBlock, noOfBlocks >
• setPrevBlock() : CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >::Block
• setTarget() : EdgeWithoutSource
• size() : SparingStack< value_type, elementsPerBlock, noOfBlocks >, CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >::Block
• sortByWeight() : EdgeVector< EdgeType, blockSize, noOfPages, pageSize >
• source() : Edge
• SparingStack() : SparingStack< value_type, elementsPerBlock, noOfBlocks >
• swap() : Edge

- t -

• target() : EdgeWithoutSource
• top() : SparingStack< value_type, elementsPerBlock, noOfBlocks >, CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >::Block
• totalWeight() : MST

- u -

• unite() : Kruskal< EdgeType >

- w -

• weight() : EdgeWithoutSource

- ~ -

• ~CommonPoolOfBlocks() : CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >
• ~Kruskal() : Kruskal< EdgeType >
• ~SparingStack() : SparingStack< value_type, elementsPerBlock, noOfBlocks >

---