The purpose of the classes in this group is fourfold.
typedef
s etc. an implementation of the concepts should provide, however completely without implementations and real data structures behind the interface. On the other hand they should provide nothing else. All the algorithms working on a data structure meeting a certain concept should compile with these classes. (Though it will not run properly, of course.) In this way it is easily to check if an algorithm doesn't use any extra feature of a certain implementation.
Classes | |
class | Heap< Prio, ItemIntMap > |
class | ReadMap< K, T > |
class | WriteMap< K, T > |
class | ReadWriteMap< K, T > |
class | ReferenceMap< K, T, R, CR > |
Dereferable map concept. More... | |
class | ReadMatrixMap< K1, K2, V > |
Readable matrix map concept. More... | |
class | WriteMatrixMap< K1, K2, V > |
Writable map concept. More... | |
class | ReadWriteMatrixMap< K1, K2, V > |
Read/Writable map concept. More... | |
class | ReferenceMatrixMap< K1, K2, V, R, CR > |
Dereferable matrix map concept. More... | |
class | Path< _Graph > |
A skeleton structure for representing directed paths in a graph. More... | |
class | PathDumper< _Graph > |
A skeleton structure for path dumpers. More... | |
Modules | |
Graph Structure Concepts | |
Skeleton and concept checking classes for graph structures. | |
Files | |
file | heap.h |
Classes for representing heaps. | |
file | maps.h |
Map concepts checking classes for testing and documenting. | |
file | matrix_maps.h |
MatrixMap concepts checking classes for testing and documenting. | |
file | path.h |
Classes for representing paths in graphs. |