MCPcopy Create free account

hub / github.com/KaHIP/KaHIP / functions

Functions2,870 in github.com/KaHIP/KaHIP

Functionforall_nodes
lib/tools/graph_extractor.cpp:29
Functionforall_nodes
lib/tools/quality_metrics.cpp:25
Functionforall_nodes
lib/tools/misc.cpp:24
Functionforall_nodes
lib/mapping/mapping_algorithms.cpp:61
Functionforall_nodes
lib/mapping/local_search_mapping.h:44
Functionforall_nodes
recompute offsets
lib/mapping/fast_construct_mapping.cpp:53
Functionforall_nodes
lib/node_ordering/nested_dissection.cpp:85
Functionforall_nodes
lib/node_ordering/ordering_tools.cpp:45
Functionforall_nodes
lib/parallel_mh/parallel_mh_async.cpp:174
Functionforall_nodes
lib/parallel_mh/population.cpp:101
Functionforall_nodes
recompute cut edges and edge cut locally
lib/parallel_mh/exchange/exchanger.cpp:157
Functionforall_nodes
lib/parallel_mh/galinier_combine/construct_partition.cpp:32
Functionforall_nodes
lib/parallel_mh/galinier_combine/gal_combine.cpp:37
Functionforall_nodes
lib/partition/graph_partitioner.cpp:97
Functionforall_nodes
lib/partition/w_cycles/wcycle_partitioner.cpp:163
Functionforall_nodes
lib/partition/initial_partitioning/bipartition.cpp:27
Functionforall_nodes
lib/partition/initial_partitioning/initial_node_separator.cpp:75
Functionforall_nodes
lib/partition/initial_partitioning/initial_partitioning.cpp:60
Functionforall_nodes
lib/partition/initial_partitioning/initial_partition_bipartition.cpp:56
Functionforall_nodes
lib/partition/uncoarsening/refinement/quotient_graph_refinement/2way_fm_refinement/two_way_fm.cpp:432
Functionforall_nodes
lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/two_way_flow_refinement.cpp:168
Functionforall_nodes
lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/most_balanced_minimum_cuts/most_balanced_minimum_cuts.cpp:34
Functionforall_nodes
lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/flow_solving_kernel/cut_flow_problem_solver.cpp:173
Functionforall_nodes
lib/partition/uncoarsening/refinement/label_propagation_refinement/label_propagation_refinement.cpp:40
Functionforall_nodes
lib/partition/uncoarsening/refinement/node_separators/fm_ns_local_search.cpp:25
Functionforall_nodes
lib/partition/uncoarsening/refinement/node_separators/greedy_ns_local_search.cpp:21
Functionforall_nodes
lib/partition/uncoarsening/refinement/node_separators/localized_fm_ns_local_search.cpp:59
Functionforall_nodes
lib/partition/uncoarsening/refinement/cycle_improvements/problem_factory.h:51
Functionforall_nodes
lib/partition/uncoarsening/refinement/cycle_improvements/greedy_neg_cycle.h:191
Functionforall_nodes
lib/partition/uncoarsening/refinement/cycle_improvements/advanced_models.h:284
Functionforall_nodes
create a new layer
lib/partition/uncoarsening/refinement/cycle_improvements/advanced_models.cpp:98
Functionforall_nodes
lib/partition/uncoarsening/refinement/cycle_improvements/cycle_refinement.cpp:94
Functionforall_nodes
lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph_fabric.cpp:44
Functionforall_nodes
lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph.h:138
Functionforall_nodes
lib/partition/uncoarsening/refinement/tabu_search/tabu_search.cpp:32
Functionforall_nodes
lib/partition/uncoarsening/separator/vertex_separator_algorithm.cpp:279
Functionforall_nodes
lib/partition/uncoarsening/separator/vertex_separator_algorithm.h:96
Functionforall_nodes
lib/partition/coarsening/contraction.cpp:51
Functionforall_nodes
lib/partition/coarsening/edge_rating/edge_ratings.cpp:105
Functionforall_nodes
lib/partition/coarsening/matching/gpa/path_set.cpp:20
Functionforall_nodes
lib/partition/coarsening/matching/gpa/gpa_matching.cpp:88
Functionforall_nodes
lib/partition/coarsening/clustering/size_constraint_label_propagation.cpp:111
Functionforall_nodes
lib/io/graph_io.cpp:23
Functionforall_nodes
lib/ilp_improve/ilp_helpers.h:130
Functionforall_nodes
lib/data_structure/graph_access.h:413
Functionforall_nodes
lib/data_structure/graph_hierarchy.cpp:54
Functionforall_nodes
lib/algorithms/topological_sort.cpp:28
Functionforall_nodes
lib/algorithms/strongly_connected_components.cpp:28
Functionforall_nodes
app/global_multisection.cpp:128
Functionforall_nodes
app/ilp_improve.cpp:114
Functionforall_nodes
app/kaffpaE.cpp:99
Functionforall_nodes
app/kaffpa.cpp:131
Functionforall_nodes
app/label_propagation.cpp:76
Functionforall_nodes
app/node_ordering.cpp:57
Functionforall_nodes
app/node_separator_ml.cpp:85
Functionforall_nodes
parallel/modified_kahip/interface/kaHIP_interface.cpp:39
Functionforall_nodes
parallel/modified_kahip/lib/tools/partition_snapshooter.cpp:37
Functionforall_nodes
parallel/modified_kahip/lib/tools/graph_extractor.cpp:28
Functionforall_nodes
parallel/modified_kahip/lib/tools/quality_metrics.cpp:24
Functionforall_nodes
parallel/modified_kahip/lib/tools/misc.cpp:24
Functionforall_nodes
parallel/modified_kahip/lib/parallel_mh/parallel_mh_async.cpp:181
Functionforall_nodes
parallel/modified_kahip/lib/parallel_mh/population.cpp:97
Functionforall_nodes
recompute cut edges and edge cut locally
parallel/modified_kahip/lib/parallel_mh/exchange/exchanger.cpp:157
Functionforall_nodes
parallel/modified_kahip/lib/parallel_mh/galinier_combine/construct_partition.cpp:32
Functionforall_nodes
parallel/modified_kahip/lib/parallel_mh/galinier_combine/gal_combine.cpp:37
Functionforall_nodes
apply partition
parallel/modified_kahip/lib/partition/graph_partitioner.cpp:121
Functionforall_nodes
parallel/modified_kahip/lib/partition/w_cycles/wcycle_partitioner.cpp:156
Functionforall_nodes
parallel/modified_kahip/lib/partition/initial_partitioning/bipartition.cpp:52
Functionforall_nodes
parallel/modified_kahip/lib/partition/initial_partitioning/initial_partitioning.cpp:52
Functionforall_nodes
parallel/modified_kahip/lib/partition/initial_partitioning/initial_partition_bipartition.cpp:56
Functionforall_nodes
parallel/modified_kahip/lib/partition/uncoarsening/refinement/quotient_graph_refinement/complete_boundary.h:111
Functionforall_nodes
parallel/modified_kahip/lib/partition/uncoarsening/refinement/quotient_graph_refinement/2way_fm_refinement/two_way_fm.cpp:423
Functionforall_nodes
parallel/modified_kahip/lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/most_balanced_minimum_cuts/most_balanced_minimum_cuts.cpp:34
Functionforall_nodes
parallel/modified_kahip/lib/partition/uncoarsening/refinement/label_propagation_refinement/label_propagation_refinement.cpp:38
Functionforall_nodes
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/problem_factory.h:51
Functionforall_nodes
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/greedy_neg_cycle.h:178
Functionforall_nodes
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/advanced_models.h:284
Functionforall_nodes
create a new layer
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/advanced_models.cpp:98
Functionforall_nodes
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/cycle_refinement.cpp:94
Functionforall_nodes
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph_fabric.cpp:44
Functionforall_nodes
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph.h:138
Functionforall_nodes
parallel/modified_kahip/lib/partition/uncoarsening/refinement/tabu_search/tabu_search.cpp:31
Functionforall_nodes
parallel/modified_kahip/lib/partition/uncoarsening/separator/vertex_separator_algorithm.cpp:145
Functionforall_nodes
parallel/modified_kahip/lib/partition/coarsening/contraction.cpp:51
Functionforall_nodes
parallel/modified_kahip/lib/partition/coarsening/edge_rating/edge_ratings.cpp:58
Functionforall_nodes
parallel/modified_kahip/lib/partition/coarsening/matching/gpa/path_set.cpp:20
Functionforall_nodes
parallel/modified_kahip/lib/partition/coarsening/matching/gpa/gpa_matching.cpp:86
Functionforall_nodes
parallel/modified_kahip/lib/partition/coarsening/clustering/size_constraint_label_propagation.cpp:114
Functionforall_nodes
parallel/modified_kahip/lib/io/graph_io.cpp:23
Functionforall_nodes
parallel/modified_kahip/lib/data_structure/graph_access.h:373
Functionforall_nodes
parallel/modified_kahip/lib/data_structure/graph_hierarchy.cpp:54
Functionforall_nodes
parallel/modified_kahip/lib/algorithms/cycle_search.cpp:60
Functionforall_nodes
parallel/modified_kahip/lib/algorithms/topological_sort.cpp:28
Functionforall_nodes
parallel/modified_kahip/lib/algorithms/strongly_connected_components.cpp:30
Functionforall_nodes
parallel/modified_kahip/app/interface_test.cpp:68
Methodforall_nodes
lib/tools/graph_partition_assertions.h:25
Methodforall_nodes
lib/node_ordering/reductions.h:147
Methodforall_nodes
lib/node_ordering/reductions.h:178
Methodforall_nodes
lib/node_ordering/reductions.cpp:148
Methodforall_nodes
lib/partition/coarsening/clustering/node_ordering.h:25
← previousnext →1,401–1,500 of 2,870, ranked by callers