Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 123]
▼Ncymealg | |
▼CdiGraph | This class defines a weighted directed graph with very limited number of operations |
CedgeTriple | An edge with a weight (used by the Edmonds algorithm) |
CposWeight | A class for representing a positive number with negative values serving as the infinity (used in the Dijkstra algorithm) |
CdummyArray | A dummy array of integers that ignores all the assigned values |
CdummyRounding | A dummy class for rounding operations which does not actually do any rounding |
CtBoostRounding | A class for rounding operations which uses the BOOST library |