Tenncor
|
#include "teq/traveler.hpp"
Go to the source code of this file.
Namespaces | |
ccur | |
Macros | |
#define | CCUR_PARTITION_HPP |
Typedefs | |
using | ccur::PartGroupsT = std::vector< std::vector< teq::iFunctor * > > |
Groups of functors. More... | |
using | ccur::OpWeightT = std::unordered_map< size_t, double > |
Map functor opcode to the operation's weight value. More... | |
Functions | |
PartGroupsT | ccur::k_partition (teq::TensptrsT roots, size_t k, OpWeightT weights=OpWeightT()) |
Return k groups of graphs under roots given some weight. More... | |
#define CCUR_PARTITION_HPP |
partition.hpp ccur
Purpose: Implement the algorithm to separate all nodes under a series of graphs into k groups as to minimize the size of each group while ensuring the parents of every node is found under the same group