Compounds | |
| class | BoundedBin |
| class | ModelBins |
| class | Partition |
| class | PartitionArray |
| class | PartitionBins |
| struct | VOTE |
| class | VoteBalance |
Functions | |
| DAGPtr | ComputeOverlappingNodeGraph (const DAGPtr ptrQueryDag, const QueryRange &r) |
| Helper function for the MOOVC algorithm. It computes a node overlapping graph, that can be delivered to FindPartitions() to partition the query graph into groups of overlapping nodes. | |
| PartitionArray | FindPartitions (const DAGPtr ptrOverlapDag) |
| Helper function for the MOOVC algorithm. | |
|
||||||||||||
|
Helper function for the MOOVC algorithm. It computes a node overlapping graph, that can be delivered to FindPartitions() to partition the query graph into groups of overlapping nodes. Since now we are working with a query range based on percentages at each dimension, we have a non symmetric overlapping relation. The following code should work for any kind of relation. Definition at line 184 of file VoteCounter.cpp. References SmartArray< double >::GetSize(). |
1.2.18