MCPcopy Create free account

hub / github.com/KaHIP/KaHIP / functions

Functions2,870 in github.com/KaHIP/KaHIP

⨍ Functions 2,870◇ Types & classes 612
Methodforall_nodes
lib/ilp_improve/ilp_exact.h:73
Methodforall_nodes
lib/ilp_improve/ilp_improve.h:285
Methodforall_nodes
lib/algorithms/push_relabel.h:199
Methodforall_nodes
app/balance_configuration.h:21
Methodforall_nodes
parallel/modified_kahip/lib/tools/graph_partition_assertions.h:25
Methodforall_nodes
parallel/modified_kahip/lib/partition/coarsening/clustering/node_ordering.h:24
Functionforall_out_edges
lib/tools/graph_extractor.cpp:45
Functionforall_out_edges
lib/tools/quality_metrics.cpp:27
Functionforall_out_edges
fix adjacent candiates
lib/mapping/local_search_mapping.cpp:34
Functionforall_out_edges
lib/mapping/mapping_algorithms.cpp:62
Functionforall_out_edges
lib/mapping/local_search_mapping.h:45
Functionforall_out_edges
lib/node_ordering/ordering_tools.cpp:25
Functionforall_out_edges
lib/parallel_mh/population.cpp:110
Functionforall_out_edges
lib/parallel_mh/exchange/exchanger.cpp:158
Functionforall_out_edges
lib/parallel_mh/galinier_combine/construct_partition.cpp:51
Functionforall_out_edges
lib/partition/initial_partitioning/bipartition.cpp:36
Functionforall_out_edges
lib/partition/initial_partitioning/bipartition.h:45
Functionforall_out_edges
lib/partition/uncoarsening/uncoarsening.cpp:54
Functionforall_out_edges
lib/partition/uncoarsening/refinement/connectivity_check.h:27
Functionforall_out_edges
First delete this node from all incidient partition boudnary and decreas the edgecut (from, target_partition != to) then insert it in the right target
lib/partition/uncoarsening/refinement/quotient_graph_refinement/complete_boundary.cpp:36
Functionforall_out_edges
update neighbors
lib/partition/uncoarsening/refinement/quotient_graph_refinement/2way_fm_refinement/two_way_fm.cpp:268
Functionforall_out_edges
lib/partition/uncoarsening/refinement/quotient_graph_refinement/2way_fm_refinement/two_way_fm.h:121
Functionforall_out_edges
lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/two_way_flow_refinement.cpp:183
Functionforall_out_edges
lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/boundary_bfs.cpp:65
Functionforall_out_edges
lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/most_balanced_minimum_cuts/most_balanced_minimum_cuts.cpp:90
Functionforall_out_edges
lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/flow_solving_kernel/cut_flow_problem_solver.cpp:43
Functionforall_out_edges
now move the node to the cluster that is most common in the neighborhood
lib/partition/uncoarsening/refinement/label_propagation_refinement/label_propagation_refinement.cpp:53
Functionforall_out_edges
lib/partition/uncoarsening/refinement/node_separators/localized_fm_ns_local_search.h:59
Functionforall_out_edges
lib/partition/uncoarsening/refinement/node_separators/greedy_ns_local_search.h:33
Functionforall_out_edges
lib/partition/uncoarsening/refinement/node_separators/fm_ns_local_search.h:55
Functionforall_out_edges
lib/partition/uncoarsening/refinement/cycle_improvements/problem_factory.h:53
Functionforall_out_edges
lib/partition/uncoarsening/refinement/cycle_improvements/greedy_neg_cycle.h:192
Functionforall_out_edges
lib/partition/uncoarsening/refinement/cycle_improvements/advanced_models.h:285
Functionforall_out_edges
lib/partition/uncoarsening/refinement/cycle_improvements/advanced_models.cpp:100
Functionforall_out_edges
lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph_fabric.h:322
Functionforall_out_edges
lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph_fabric.cpp:54
Functionforall_out_edges
lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph.h:139
Functionforall_out_edges
lib/partition/uncoarsening/refinement/tabu_search/tabu_search.cpp:45
Functionforall_out_edges
update gain of neighbors / the boundaries have allready been updated
lib/partition/uncoarsening/refinement/kway_graph_refinement/kway_graph_refinement_core.h:128
Functionforall_out_edges
lib/partition/uncoarsening/refinement/kway_graph_refinement/kway_graph_refinement_commons.h:74
Functionforall_out_edges
lib/partition/uncoarsening/refinement/kway_graph_refinement/multitry_kway_fm.cpp:138
Functionforall_out_edges
lib/partition/uncoarsening/separator/vertex_separator_algorithm.cpp:57
Functionforall_out_edges
lib/partition/uncoarsening/separator/vertex_separator_algorithm.h:102
Functionforall_out_edges
lib/partition/uncoarsening/separator/vertex_separator_flow_solver.cpp:87
Functionforall_out_edges
do something with all outgoing edges (in auxillary graph)
lib/partition/coarsening/contraction.cpp:65
Functionforall_out_edges
lib/partition/coarsening/edge_rating/edge_ratings.cpp:116
Functionforall_out_edges
lib/partition/coarsening/matching/gpa/gpa_matching.cpp:145
Functionforall_out_edges
lib/partition/coarsening/clustering/size_constraint_label_propagation.cpp:160
Functionforall_out_edges
lib/io/graph_io.cpp:25
Functionforall_out_edges
lib/ilp_improve/ilp_helpers.h:73
Functionforall_out_edges
lib/data_structure/graph_access.h:415
Functionforall_out_edges
lib/algorithms/topological_sort.cpp:45
Functionforall_out_edges
app/kaffpaE.cpp:71
Functionforall_out_edges
app/partition_to_vertex_separator.cpp:123
Functionforall_out_edges
app/kaffpa.cpp:102
Functionforall_out_edges
app/node_separator_ml.cpp:123
Functionforall_out_edges
parallel/modified_kahip/lib/tools/graph_extractor.cpp:44
Functionforall_out_edges
parallel/modified_kahip/lib/tools/quality_metrics.cpp:26
Functionforall_out_edges
parallel/modified_kahip/lib/parallel_mh/population.cpp:106
Functionforall_out_edges
parallel/modified_kahip/lib/parallel_mh/exchange/exchanger.cpp:158
Functionforall_out_edges
parallel/modified_kahip/lib/parallel_mh/galinier_combine/construct_partition.cpp:51
Functionforall_out_edges
parallel/modified_kahip/lib/partition/initial_partitioning/bipartition.cpp:133
Functionforall_out_edges
parallel/modified_kahip/lib/partition/initial_partitioning/bipartition.h:44
Functionforall_out_edges
parallel/modified_kahip/lib/partition/uncoarsening/refinement/quotient_graph_refinement/complete_boundary.h:120
Functionforall_out_edges
First delete this node from all incidient partition boudnary and decreas the edgecut (from, target_partition != to) then insert it in the right target
parallel/modified_kahip/lib/partition/uncoarsening/refinement/quotient_graph_refinement/complete_boundary.cpp:35
Functionforall_out_edges
update neighbors
parallel/modified_kahip/lib/partition/uncoarsening/refinement/quotient_graph_refinement/2way_fm_refinement/two_way_fm.cpp:259
Functionforall_out_edges
parallel/modified_kahip/lib/partition/uncoarsening/refinement/quotient_graph_refinement/2way_fm_refinement/two_way_fm.h:121
Functionforall_out_edges
parallel/modified_kahip/lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/boundary_bfs.cpp:65
Functionforall_out_edges
parallel/modified_kahip/lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/most_balanced_minimum_cuts/most_balanced_minimum_cuts.cpp:78
Functionforall_out_edges
parallel/modified_kahip/lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/flow_solving_kernel/edge_cut_flow_solver.cpp:40
Functionforall_out_edges
now move the node to the cluster that is most common in the neighborhood
parallel/modified_kahip/lib/partition/uncoarsening/refinement/label_propagation_refinement/label_propagation_refinement.cpp:51
Functionforall_out_edges
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/problem_factory.h:53
Functionforall_out_edges
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/greedy_neg_cycle.h:179
Functionforall_out_edges
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/advanced_models.h:285
Functionforall_out_edges
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/advanced_models.cpp:100
Functionforall_out_edges
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph_fabric.h:309
Functionforall_out_edges
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph_fabric.cpp:54
Functionforall_out_edges
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph.h:139
Functionforall_out_edges
parallel/modified_kahip/lib/partition/uncoarsening/refinement/tabu_search/tabu_search.cpp:44
Functionforall_out_edges
update gain of neighbors / the boundaries have allready been updated
parallel/modified_kahip/lib/partition/uncoarsening/refinement/kway_graph_refinement/kway_graph_refinement_core.h:121
Functionforall_out_edges
parallel/modified_kahip/lib/partition/uncoarsening/refinement/kway_graph_refinement/kway_graph_refinement_commons.h:82
Functionforall_out_edges
parallel/modified_kahip/lib/partition/uncoarsening/refinement/kway_graph_refinement/multitry_kway_fm.cpp:137
Functionforall_out_edges
parallel/modified_kahip/lib/partition/uncoarsening/separator/vertex_separator_algorithm.cpp:146
Functionforall_out_edges
parallel/modified_kahip/lib/partition/uncoarsening/separator/vertex_separator_flow_solver.cpp:132
Functionforall_out_edges
do something with all outgoing edges (in auxillary graph)
parallel/modified_kahip/lib/partition/coarsening/contraction.cpp:65
Functionforall_out_edges
parallel/modified_kahip/lib/partition/coarsening/edge_rating/edge_ratings.cpp:69
Functionforall_out_edges
parallel/modified_kahip/lib/partition/coarsening/matching/gpa/gpa_matching.cpp:143
Functionforall_out_edges
parallel/modified_kahip/lib/partition/coarsening/clustering/size_constraint_label_propagation.cpp:163
Functionforall_out_edges
parallel/modified_kahip/lib/io/graph_io.cpp:25
Functionforall_out_edges
parallel/modified_kahip/lib/data_structure/graph_access.h:375
Functionforall_out_edges
parallel/modified_kahip/lib/algorithms/cycle_search.cpp:43
Functionforall_out_edges
parallel/modified_kahip/lib/algorithms/topological_sort.cpp:45
Functionforall_out_edges
parallel/modified_kahip/lib/algorithms/strongly_connected_components.cpp:53
Functionforall_out_edges
parallel/parallel_src/lib/parallel_contraction_projection/parallel_projection.cpp:143
Functionforall_out_edges
parallel/parallel_src/lib/parallel_contraction_projection/parallel_contraction.cpp:251
Functionforall_out_edges
parallel/parallel_src/lib/parallel_contraction_projection/parallel_block_down_propagation.cpp:109
Functionforall_out_edges
parallel/parallel_src/lib/tools/distributed_quality_metrics.cpp:22
Functionforall_out_edges
parallel/parallel_src/lib/io/parallel_graph_io.cpp:516
Functionforall_out_edges
parallel/parallel_src/lib/communication/mpi_tools.cpp:104
Functionforall_out_edges
parallel/parallel_src/app/dspac.cpp:176
← previousnext →1,501–1,600 of 2,870, ranked by callers