| Buckets< nodesPerBucket > | Represents an algorithm for reducing the number of nodes of a graph (in order to compute a minimum spanning tree) and the required data structures |
| CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks > | A CommonPoolOfBlocks manages blocks which can contain several elements of a specified value_type |
| CommonPoolOfBlocks< value_type, elementsPerBlock, noOfBlocks >::Block | A block which can contain several elements |
| DuplicatesRemover< SuperContainer > | A container which can be used as an 'intermediate station' in order to remove multiple edges |
| Edge | Represents a directed and weighted edge |
| EdgeVector< EdgeType, blockSize, noOfPages, pageSize > | Represents a weighted graph by a list of Edges |
| EdgeWithoutSource | Represents an edge without the source vertex |
| GetWeight< EdgeType > | Extracts the weight of an edge |
| Kruskal< EdgeType > | Represents Kruskal's algorithm for determining a Minimum Spanning Tree of a weighted graph and the required union/find data structure |
| MST | Represents a Minimum Spanning Tree (MST) of a graph |
| PQueue | Represents an algorithm for reducing the number of nodes of a graph (in order to compute a minimum spanning tree) and the required data structures |
| Randomizer< Bijection > | A bijection over {0,...,n-1} that can be used to randomize an Edge in order to obtain a (pseudo-)random permutation |
| RandomizerFeistel | A bijection that uses Feistel permutations |
| RandomizerLinearCongruence | A bijection that uses the linear congruential method |
| RelabeledEdge | Represents a relabeled edge |
| RelabeledEdgeWithoutSource | Represents a relabeled edge without the source vertex |
| REWS_SparingStack< elementsPerBlock, noOfBlocks > | A specialized SparingStack which stores RelabeledEdgeWithoutSource-objects |
| SourceTargetWeightOrdering | A StrictWeakOrdering predicate which can be used to compare two edges first by the source vertex, then - if the source vertices are equal - by the target vertex and finally by weight |
| SourceWeightOrdering< EdgeType > | A StrictWeakOrdering predicate which can be used to compare two edges first by the source vertex, then - if the source vertices are equal - by weight |
| SparingStack< value_type, elementsPerBlock, noOfBlocks > | A stack which stores its elements in blocks which are managed by a CommonPoolOfBlocks |
| WeightOrdering< EdgeType > | A StrictWeakOrdering predicate which can be used to compare two edges by weight |
