MCPcopy Create free account

hub / github.com/KaHIP/KaHIP / functions

Functions2,870 in github.com/KaHIP/KaHIP

↓ 1 callersFunctionarg_reset
parallel/parallel_src/extern/argtable3-3.2.2/argtable3.c:5347
↓ 1 callersMethodbalance_edges
lib/tools/quality_metrics.cpp:315
↓ 1 callersMethodbuildOverlapGraph
lib/ilp_improve/ilp_improve.h:492
↓ 1 callersMethodbuild_cycle_problem
lib/partition/uncoarsening/refinement/cycle_improvements/problem_factory.h:42
↓ 1 callersMethodbuild_cycle_problem
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/problem_factory.h:42
↓ 1 callersMethodbuild_cycle_problem_with_reverse
lib/partition/uncoarsening/refinement/cycle_improvements/problem_factory.h:69
↓ 1 callersMethodbuild_cycle_problem_with_reverse
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/problem_factory.h:69
↓ 1 callersMethodbuild_from_metis
lib/data_structure/graph_access.h:476
↓ 1 callersMethodbuild_from_metis
parallel/modified_kahip/lib/data_structure/graph_access.h:436
↓ 1 callersMethodbuild_from_metis_weighted
lib/data_structure/graph_access.h:499
↓ 1 callersMethodbuild_from_metis_weighted
parallel/modified_kahip/lib/data_structure/graph_access.h:460
↓ 1 callersMethodbuild_from_metis_weighted
parallel/parallel_src/lib/data_structure/parallel_graph_access.h:770
↓ 1 callersMethodbuild_shortest_path_problem
lib/partition/uncoarsening/refinement/cycle_improvements/problem_factory.h:103
↓ 1 callersMethodbuild_shortest_path_problem
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/problem_factory.h:103
↓ 1 callersFunctioncalculateToNode
* Same as calculateFromNode(), but calculates that last node that should be on the given PE. */
parallel/parallel_src/lib/dspac/edge_balanced_graph_io.cpp:229
↓ 1 callersMethodcalculate_vertex_cut
parallel/parallel_src/lib/dspac/dspac.cpp:405
↓ 1 callersMethodcheck_conflict
lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph.h:213
↓ 1 callersMethodcheck_conflict
parallel/modified_kahip/lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph.h:213
↓ 1 callersFunctionclique_test
Helper function to test if a node and its neighborhood form a clique G: input graph node: node to be tested actual_de
lib/node_ordering/reductions.cpp:92
↓ 1 callersFunctionclosed_neighborhood_hash
lib/node_ordering/reductions.cpp:286
↓ 1 callersMethodcnativeKaffpa
(int n, int[] vwgt, int[] xadj, int[] adjcwgt, int[] adjncy, int nparts, double imbalance, boolean suppr
misc/java_jni_wrapper/KaHIPWrapper.java:41
↓ 1 callersMethodcollect_parallel_graph_to_local_graph
parallel/parallel_src/lib/communication/mpi_tools.cpp:86
↓ 1 callersMethodcombine
lib/parallel_mh/population.cpp:193
↓ 1 callersMethodcombine
parallel/modified_kahip/lib/parallel_mh/population.cpp:189
↓ 1 callersMethodcombine_cross
lib/parallel_mh/population.cpp:251
↓ 1 callersMethodcombine_cross
parallel/modified_kahip/lib/parallel_mh/population.cpp:247
↓ 1 callersMethodcomputeBFS
lib/ilp_improve/ilp_improve.h:27
↓ 1 callersMethodcomputeBlocks
lib/ilp_improve/ilp_improve.h:279
↓ 1 callersMethodcompute_good_balanced_min_cut
parallel/modified_kahip/lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/most_balanced_minimum_cuts/most_balanced_minimum_cuts.cpp:22
↓ 1 callersMethodcompute_node_separator
lib/partition/initial_partitioning/initial_node_separator.cpp:64
↓ 1 callersMethodcompute_vertex_separator_simple
lib/partition/uncoarsening/separator/vertex_separator_algorithm.cpp:635
↓ 1 callersMethodcompute_vertex_separator_simpler
lib/partition/uncoarsening/separator/vertex_separator_algorithm.cpp:581
↓ 1 callersMethodconstruct
parallel/parallel_src/lib/dspac/dspac.cpp:15
↓ 1 callersMethodconstruct_initial_mapping
lib/mapping/construct_mapping.cpp:24
↓ 1 callersMethodconstruct_initial_mapping_bottomup
lib/mapping/fast_construct_mapping.cpp:26
↓ 1 callersMethodconstruct_initial_mapping_topdown
lib/mapping/fast_construct_mapping.cpp:61
↓ 1 callersMethodconstruct_matrix
lib/mapping/construct_distance_matrix.h:20
↓ 1 callersMethodconstruct_starting_from_partition
lib/parallel_mh/galinier_combine/construct_partition.cpp:27
↓ 1 callersMethodconstruct_starting_from_partition
parallel/modified_kahip/lib/parallel_mh/galinier_combine/construct_partition.cpp:27
↓ 1 callersMethodcontract_to_distributed_quotient
parallel/parallel_src/lib/parallel_contraction_projection/parallel_contraction.cpp:20
↓ 1 callersMethodcontraction_stop
parallel/parallel_src/lib/distributed_partitioning/stop_rule.h:19
↓ 1 callersMethodcount_reduction
lib/node_ordering/reductions.h:46
↓ 1 callersMethodcreateIndividuum
lib/parallel_mh/galinier_combine/construct_partition.cpp:108
↓ 1 callersMethodcreateIndividuum
parallel/modified_kahip/lib/parallel_mh/galinier_combine/construct_partition.cpp:108
↓ 1 callersMethodcreatePartitions
lib/ilp_improve/ilp_improve.h:457
↓ 1 callersFunctioncutBFSStartNodes
lib/ilp_improve/ilp_helpers.h:152
↓ 1 callersMethoddecreaseKey
lib/node_ordering/reductions.cpp:163
↓ 1 callersMethoddeleteMin
lib/node_ordering/reductions.cpp:173
↓ 1 callersMethoddeleteMin
lib/partition/uncoarsening/refinement/tabu_search/tabu_moves_queue.h:70
↓ 1 callersMethoddeleteMin
parallel/modified_kahip/lib/partition/uncoarsening/refinement/tabu_search/tabu_moves_queue.h:70
↓ 1 callersMethoddistribute_local_graph
parallel/parallel_src/lib/communication/mpi_tools.cpp:169
↓ 1 callersMethoddiversify
lib/parallel_mh/diversifyer.h:18
↓ 1 callersMethoddiversify
parallel/modified_kahip/lib/parallel_mh/diversifyer.h:18
↓ 1 callersMethoddiversify_kaba
lib/parallel_mh/diversifyer.h:25
↓ 1 callersMethoddiversify_kaba
parallel/modified_kahip/lib/parallel_mh/diversifyer.h:25
↓ 1 callersMethoddone
lib/mapping/full_search_space.h:22
↓ 1 callersMethodempty
lib/data_structure/priority_queues/bucket_pq.h:74
↓ 1 callersMethodensemble_two_clusterings
lib/partition/coarsening/clustering/size_constraint_label_propagation.cpp:63
↓ 1 callersFunctionexecuteParhip
parallel/parallel_src/app/dspac.cpp:142
↓ 1 callersFunctionexecute_kahip
app/spac.cpp:93
↓ 1 callersMethodextract_two_blocks
lib/tools/graph_extractor.cpp:59
↓ 1 callersMethodextract_two_blocks
parallel/modified_kahip/lib/tools/graph_extractor.cpp:58
↓ 1 callersMethodfastComputeQuotientGraph
lib/partition/uncoarsening/refinement/quotient_graph_refinement/complete_boundary.h:513
↓ 1 callersFunctionfile_exists
parallel/parallel_src/lib/tools/helpers.h:48
↓ 1 callersFunctionfile_size
lib/io/mmap_graph_io.h:35
↓ 1 callersMethodfilter_duplicates
parallel/parallel_src/lib/tools/helpers.h:26
↓ 1 callersMethodfindPresets
lib/ilp_improve/ilp_improve.h:541
↓ 1 callersFunctionfind_replacements
Find the nodes to replace degree-2 nodes
lib/node_ordering/reductions.cpp:635
↓ 1 callersMethodfind_separator
lib/partition/uncoarsening/separator/vertex_separator_flow_solver.cpp:26
↓ 1 callersMethodfind_separator
parallel/modified_kahip/lib/partition/uncoarsening/separator/vertex_separator_flow_solver.cpp:24
↓ 1 callersFunctionfind_shortoption
* Return index of first table entry with a matching short option * or -1 if no match was found. */
extern/argtable3-3.2.2/argtable3.c:5008
↓ 1 callersFunctionfind_shortoption
* Return index of first table entry with a matching short option * or -1 if no match was found. */
parallel/parallel_src/extern/argtable3-3.2.2/argtable3.c:5008
↓ 1 callersMethodfix_cut_dominant_edges
parallel/parallel_src/lib/dspac/dspac.cpp:434
↓ 1 callersFunctionforall_blocks
lib/tools/quality_metrics.cpp:241
↓ 1 callersFunctionforall_nodes
interface/kaHIP_interface.cpp:87
↓ 1 callersFunctionforall_nodes
lib/partition/uncoarsening/refinement/quotient_graph_refinement/complete_boundary.h:114
↓ 1 callersFunctionforall_nodes
lib/partition/coarsening/matching/random_matching.cpp:42
↓ 1 callersFunctionforall_nodes
app/fast_node_ordering.cpp:56
↓ 1 callersFunctionforall_nodes
parallel/modified_kahip/lib/partition/coarsening/matching/random_matching.cpp:42
↓ 1 callersFunctionforall_out_edges
lib/node_ordering/reductions.cpp:58
↓ 1 callersFunctionforall_out_edges
lib/partition/uncoarsening/refinement/quotient_graph_refinement/complete_boundary.h:123
↓ 1 callersFunctionforall_out_edges
lib/partition/coarsening/matching/random_matching.cpp:54
↓ 1 callersFunctionforall_out_edges
parallel/modified_kahip/lib/partition/coarsening/matching/random_matching.cpp:54
↓ 1 callersFunctiongainBFSStartNodes
lib/ilp_improve/ilp_helpers.h:178
↓ 1 callersFunctiongcd
_WIN32*/ * Compute the greatest common divisor of a and b. */
extern/argtable3-3.2.2/argtable3.c:1473
↓ 1 callersFunctiongcd
_WIN32*/ * Compute the greatest common divisor of a and b. */
parallel/parallel_src/extern/argtable3-3.2.2/argtable3.c:1473
↓ 1 callersMethodgetCommunicator
parallel/parallel_src/lib/data_structure/parallel_graph_access.h:429
↓ 1 callersMethodgetEdgecut
()
misc/java_jni_wrapper/KaHIPWrapperResult.java:12
↓ 1 callersMethodgetUnderlyingK
parallel/modified_kahip/lib/partition/uncoarsening/refinement/kway_graph_refinement/kway_graph_refinement_commons.h:63
↓ 1 callersFunctionget_argcmd_testsuite
extern/argtable3-3.2.2/tests/testargcmd.c:85
↓ 1 callersFunctionget_argcmd_testsuite
parallel/parallel_src/extern/argtable3-3.2.2/tests/testargcmd.c:85
↓ 1 callersFunctionget_argdate_testsuite
extern/argtable3-3.2.2/tests/testargdate.c:360
↓ 1 callersFunctionget_argdate_testsuite
parallel/parallel_src/extern/argtable3-3.2.2/tests/testargdate.c:360
↓ 1 callersFunctionget_argdbl_testsuite
extern/argtable3-3.2.2/tests/testargdbl.c:429
↓ 1 callersFunctionget_argdbl_testsuite
parallel/parallel_src/extern/argtable3-3.2.2/tests/testargdbl.c:429
↓ 1 callersFunctionget_argdstr_testsuite
extern/argtable3-3.2.2/tests/testargdstr.c:110
↓ 1 callersFunctionget_argdstr_testsuite
parallel/parallel_src/extern/argtable3-3.2.2/tests/testargdstr.c:110
↓ 1 callersFunctionget_argfile_testsuite
extern/argtable3-3.2.2/tests/testargfile.c:765
↓ 1 callersFunctionget_argfile_testsuite
parallel/parallel_src/extern/argtable3-3.2.2/tests/testargfile.c:765
↓ 1 callersFunctionget_arghashtable_testsuite
extern/argtable3-3.2.2/tests/testarghashtable.c:262
← previousnext →701–800 of 2,870, ranked by callers