MCPcopy Create free account

hub / github.com/KaHIP/KaHIP / functions

Functions2,870 in github.com/KaHIP/KaHIP

Methodcompute_gain
lib/partition/uncoarsening/refinement/node_separators/fm_ns_local_search.h:50
Methodcompute_gain
parallel/modified_kahip/lib/partition/initial_partitioning/bipartition.h:41
Methodcompute_label_mapping
parallel/parallel_src/lib/parallel_contraction_projection/parallel_contraction.cpp:59
Methodcompute_new_rhs
lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/most_balanced_minimum_cuts/most_balanced_minimum_cuts.cpp:74
Methodcompute_new_rhs
parallel/modified_kahip/lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/most_balanced_minimum_cuts/most_balanced_minimum_cuts.cpp:61
Methodcompute_separator
lib/node_ordering/nested_dissection.cpp:74
Methodcompute_tenure
lib/partition/uncoarsening/refinement/tabu_search/tabu_search.h:27
Methodcompute_tenure
parallel/modified_kahip/lib/partition/uncoarsening/refinement/tabu_search/tabu_search.h:27
Methodcompute_vertex_movements_rebalance_ultra
lib/partition/uncoarsening/refinement/cycle_improvements/advanced_models.cpp:32
Methodcompute_vertex_movements_rebalance_ultra
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/advanced_models.cpp:32
Methodcompute_vertex_separator_simple
parallel/modified_kahip/lib/partition/uncoarsening/separator/vertex_separator_algorithm.cpp:91
Methodconfiguration
app/configuration.h:16
Methodconfiguration
parallel/modified_kahip/app/configuration.h:15
Methodconfiguration
parallel/parallel_src/app/configuration.h:16
Methodconstruct_distance_matrix
lib/mapping/construct_distance_matrix.cpp:11
Methodconstruct_fast_hierarchy_bottomup
lib/mapping/construct_mapping.cpp:382
Methodconstruct_fast_hierarchy_topdown
lib/mapping/construct_mapping.cpp:387
Methodconstruct_flow_pb
parallel/modified_kahip/lib/partition/uncoarsening/separator/vertex_separator_flow_solver.cpp:106
Methodconstruct_identity
lib/mapping/construct_mapping.cpp:371
Methodconstruct_initial_mapping_bottomup_internal
lib/mapping/fast_construct_mapping.cpp:31
Methodconstruct_initial_mapping_topdown_internal
lib/mapping/fast_construct_mapping.cpp:71
Methodconstruct_local_searches_on_qgraph_edge
lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph_fabric.cpp:236
Methodconstruct_local_searches_on_qgraph_edge
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph_fabric.cpp:236
Methodconstruct_mapping
lib/mapping/construct_mapping.cpp:16
Methodconstruct_matrix_hierarchy
lib/mapping/construct_distance_matrix.h:65
Methodconstruct_matrix_identity
lib/mapping/construct_distance_matrix.h:56
Methodconstruct_matrix_random
lib/mapping/construct_distance_matrix.h:46
Methodconstruct_old_growing
lib/mapping/construct_mapping.cpp:178
Methodconstruct_old_growing_faster
lib/mapping/construct_mapping.cpp:260
Methodconstruct_old_growing_matrix
lib/mapping/construct_mapping.cpp:56
Methodconstruct_partition
lib/parallel_mh/galinier_combine/construct_partition.cpp:19
Methodconstruct_partition
parallel/modified_kahip/lib/parallel_mh/galinier_combine/construct_partition.cpp:19
Methodconstruct_random
lib/mapping/construct_mapping.cpp:377
Methodcontains
check if a node is part of this clique
lib/node_ordering/min_degree_ordering.h:23
Methodcontains
lib/partition/uncoarsening/refinement/quotient_graph_refinement/complete_boundary.h:232
Methodcontains
lib/data_structure/priority_queues/maxNodeHeap.h:285
Methodcontains
lib/data_structure/priority_queues/bucket_pq.h:152
Methodcontains
parallel/modified_kahip/lib/partition/uncoarsening/refinement/quotient_graph_refinement/complete_boundary.h:229
Methodcontains
parallel/modified_kahip/lib/data_structure/priority_queues/maxNodeHeap.h:284
Methodcontains
parallel/modified_kahip/lib/data_structure/priority_queues/bucket_pq.h:150
Methodcontains
find table position or the next free table position if it is not contained
parallel/parallel_src/lib/data_structure/linear_probing_hashmap_ll.h:52
Methodcontains
find table position or the next free table position if it is not contained
parallel/parallel_src/lib/data_structure/linear_probing_hashmap.h:52
Methodcontract_clustering
lib/partition/coarsening/contraction.cpp:94
Methodcontract_clustering
parallel/modified_kahip/lib/partition/coarsening/contraction.cpp:94
Functioncontract_nodes
Input: - 'graph_before': the graph before contraction - 'node_groups': the groups of nodes to be contracted Outputs: - 'graph_af
lib/node_ordering/reductions.cpp:32
Methodcontraction
lib/partition/coarsening/contraction.cpp:12
Methodcontraction
parallel/modified_kahip/lib/partition/coarsening/contraction.cpp:12
Methodconvert_ds
lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/flow_solving_kernel/cut_flow_problem_solver.cpp:67
Methodconvert_ds
parallel/modified_kahip/lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/flow_solving_kernel/edge_cut_flow_solver.cpp:64
Methodconvert_residualGraph
lib/partition/uncoarsening/separator/vertex_separator_algorithm.h:90
Methodcopy
lib/data_structure/graph_access.h:521
Methodcopy
parallel/modified_kahip/lib/data_structure/graph_access.h:483
Methodcount_deg2_separators
lib/node_ordering/reductions.h:61
Methodcreate_coarsemapping
lib/partition/coarsening/clustering/size_constraint_label_propagation.cpp:198
Methodcreate_coarsemapping
parallel/modified_kahip/lib/partition/coarsening/clustering/size_constraint_label_propagation.cpp:201
Methodcut_flow_problem_solver
lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/flow_solving_kernel/cut_flow_problem_solver.cpp:24
Methodcycle_refinement
lib/partition/uncoarsening/refinement/cycle_improvements/cycle_refinement.cpp:15
Methodcycle_refinement
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/cycle_refinement.cpp:15
Methodcycle_search
lib/algorithms/cycle_search.cpp:18
Methodcycle_search
parallel/modified_kahip/lib/algorithms/cycle_search.cpp:17
Methodcycleorpath_has_conflicts
lib/partition/uncoarsening/refinement/cycle_improvements/advanced_models.h:94
Methodcycleorpath_has_conflicts
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/advanced_models.h:94
Methoddata_boundary_pair
lib/partition/uncoarsening/refinement/quotient_graph_refinement/boundary_lookup.h:49
Methoddata_boundary_pair
parallel/modified_kahip/lib/partition/uncoarsening/refinement/quotient_graph_refinement/boundary_lookup.h:48
Methoddata_ensemble_pair
lib/partition/coarsening/clustering/size_constraint_label_propagation.h:36
Methoddata_ensemble_pair
parallel/modified_kahip/lib/partition/coarsening/clustering/size_constraint_label_propagation.h:36
Methoddata_hashed_edge
parallel/parallel_src/lib/data_structure/hashed_graph.h:34
Methoddata_qgraph_edge
lib/partition/uncoarsening/refinement/cycle_improvements/cycle_definitions.h:24
Methoddata_qgraph_edge
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/cycle_definitions.h:24
Functiondbg_printf
extern/argtable3-3.2.2/argtable3.c:321
Functiondbg_printf
parallel/parallel_src/extern/argtable3-3.2.2/argtable3.c:321
MethoddecreaseKey
lib/partition/uncoarsening/refinement/tabu_search/tabu_bucket_queue.h:122
MethoddecreaseKey
lib/data_structure/priority_queues/maxNodeHeap.h:262
MethoddecreaseKey
lib/data_structure/priority_queues/bucket_pq.h:105
MethoddecreaseKey
parallel/modified_kahip/lib/partition/uncoarsening/refinement/tabu_search/tabu_bucket_queue.h:121
MethoddecreaseKey
parallel/modified_kahip/lib/data_structure/priority_queues/maxNodeHeap.h:261
MethoddecreaseKey
parallel/modified_kahip/lib/data_structure/priority_queues/bucket_pq.h:103
MethoddeleteMax
lib/data_structure/priority_queues/maxNodeHeap.h:221
MethoddeleteMax
parallel/modified_kahip/lib/data_structure/priority_queues/maxNodeHeap.h:220
MethoddeleteMax
parallel/modified_kahip/lib/data_structure/priority_queues/bucket_pq.h:84
MethoddeleteNode
lib/partition/uncoarsening/refinement/quotient_graph_refinement/complete_boundary.h:243
MethoddeleteNode
lib/data_structure/priority_queues/maxNodeHeap.h:193
MethoddeleteNode
parallel/modified_kahip/lib/partition/uncoarsening/refinement/quotient_graph_refinement/complete_boundary.h:240
MethoddeleteNode
parallel/modified_kahip/lib/data_structure/priority_queues/maxNodeHeap.h:191
MethoddeleteNode
parallel/modified_kahip/lib/data_structure/priority_queues/bucket_pq.h:120
Methoddirected_more_locallized_search
this method performes a directed localized local search and UNDOs them these searches are for the augmented qgraph structure for balanced graph partit
lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph_fabric.cpp:290
Methoddirected_more_locallized_search
this method performes a directed localized local search and UNDOs them these searches are for the augmented qgraph structure for balanced graph partit
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph_fabric.cpp:290
Methoddischarge
try to push as much excess as possible out of the node node
lib/algorithms/push_relabel.h:116
Methoddistributed_evolutionary_partitioning
parallel/parallel_src/lib/distributed_partitioning/initial_partitioning/distributed_evolutionary_partitioning.cpp:15
Methoddistributed_partitioner
parallel/parallel_src/lib/distributed_partitioning/distributed_partitioner.cpp:26
Methoddistributed_quality_metrics
parallel/parallel_src/lib/tools/distributed_quality_metrics.cpp:11
Methoddiversify_population
lib/parallel_mh/exchange/exchanger.cpp:72
Methoddiversify_population
parallel/modified_kahip/lib/parallel_mh/exchange/exchanger.cpp:72
Methoddiversifyer
lib/parallel_mh/diversifyer.h:15
Methoddiversifyer
parallel/modified_kahip/lib/parallel_mh/diversifyer.h:15
Methoddone
lib/mapping/communication_graph_search_space.h:39
Methoddone
lib/mapping/full_search_space_pruned.h:22
Methoddspac
parallel/parallel_src/lib/dspac/dspac.cpp:11
Methoddummy_operations
parallel/parallel_src/lib/communication/dummy_operations.cpp:12
Functiondump_longoptions
extern/argtable3-3.2.2/argtable3.c:5024
← previousnext →1,201–1,300 of 2,870, ranked by callers