13 #ifndef MTMETIS_PARTITION_H 14 #define MTMETIS_PARTITION_H 31 #define partition_vertexseparator MTMETIS_partition_vertexseparator 46 #define partition_print_info MTMETIS_print_info 57 pid_type
const *
const * where);
67 #define par_partition_kway MTMETIS_par_partition_kway 82 #define par_partition_rb MTMETIS_par_partition_rb 97 #define par_partition_edgeseparator MTMETIS_par_partition_edgeseparator 112 #define par_partition_vertexseparator MTMETIS_par_partition_vertexseparator 127 #define par_partition_pre MTMETIS_par_partition_pre Type and function prototypes for the ctrl structure.
void par_partition_pre(ctrl_type *ctrl, graph_type *graph)
Pre-partition a graph, for redistribution among threads.
Definition: partition.c:829
void par_partition_rb(ctrl_type *ctrl, graph_type *graph, pid_type **where)
Entry level function for multithreaded kway partitioning. Should be called by all threads in a parall...
Definition: partition.c:745
void par_partition_edgeseparator(ctrl_type *ctrl, graph_type *graph, pid_type **where)
Create a edge separator where partitions 0 and 1 are the two halves and 2 is the separator.
Definition: partition.c:799
Types and functions for distributed graph objects.
void par_partition_kway(ctrl_type *ctrl, graph_type *graph, pid_type **where)
Entry level function for multithreaded kway partitioning. Should be called by all threads in a parall...
Definition: partition.c:714
void par_partition_vertexseparator(ctrl_type *ctrl, graph_type *graph, pid_type **where)
Create a vertex separator where partitions 0 and 1 are the two halves and 2 is the separator...
Definition: partition.c:776
void partition_print_info(ctrl_type const *ctrl, graph_type const *graph, pid_type const *const *where)
Print information about a partition.
Definition: partition.c:569
void partition_vertexseparator(ctrl_type *ctrl, graph_type *graph, pid_type **where)
Find a small vertex separator. Partitions 0 and 1 are the two halves, and partition 2 is the separato...