.. _program_listing_file_src_partition_partition.h: Program Listing for File partition.h ==================================== |exhale_lsh| :ref:`Return to documentation for file ` (``src/partition/partition.h``) .. |exhale_lsh| unicode:: U+021B0 .. UPWARDS ARROW WITH TIP LEFTWARDS .. code-block:: cpp #ifndef PARTITION_H #define PARTITION_H #include #include "defs.h" #include "initial.h" #include "refine/RefinementFacade.h" #include "refine/pipeline/CandidateSelector.h" #include "refine/pipeline/FPGARemapper.h" void COCP(MultilevelCoarsener &mc, const graph &finest, const fpga &fpgas, const PartitionParams ¶, int thread, vector> &candidate_parts, vector> &candidate_available_resources, HSFullTiming::HSPartitionFlow &pFlow); void V_Cycle(graph &finest, const fpga &fpgas, const PartitionParams ¶, int thread, vector> &candidate_parts, vector> &candidate_available_resources, HSFullTiming::HSPartitionFlow &pFlow); int multilevel(const graph &finest, const fpga &fpgas, const PartitionParams ¶, int thread, int coarsen_order, vector> &multi_candidate_parts, vector> &multi_candidate_available_resources, vector &multi_candidate_metrics, mutex &mtx, HSFullTiming::HSPartitionFlow &pFlow); int partition(graph &finest, fpga &fpgas, vector &parts, const PartitionParams ¶, int thread, HSFullTiming::HSPartitionFlow &pFlow); int partition(graph &finest, fpga &fpgas, vector &parts, const PartitionParams ¶, int thread, flat_hash_map &fixed_assignment, unordered_map> &group_assignment, flat_hash_map &name_map, HSFullTiming::HSPartitionFlow &pFlow); void separateGraph(const graph &finest, const fpga &fpgas, const vector &parts, vector &sub_graphs, vector> &id2node); int partitionHierarchyGraph( graph &finest, const hierarchy &hierarchy_root, const PartitionParams ¶, int thread, vector> &node_paths, HSFullTiming::HSPartitionFlow &pFlow, vector *cut_records = nullptr, graph *dedup_root_graph = nullptr); #endif