This page summarizes options relative to graph build for graph partitioning with ParMetis, Scotch, sparse matrix ordering with ParMetis, Scotch, and graph coloring.
Parameters: | |
CHECK_GRAPH | Level of error checking for graph input: 0 = no checking, 1 = on-processor checking, 2 = full checking. (CHECK_GRAPH==2 is very slow and should be used only during debugging). |
GRAPH_SYMMETRIZE | How to symmetrize the graph:
NONE = graph is symmetric and no symmetrization is needed TRANSPOSE = if M is adjacency matrix of the input graph, output will be the graph representation of M+MT BIPARTITE = graph is symmetrized in a bipartite way : [[ 0 M ][Mt 0]] |
GRAPH_SYM_WEIGHT | How edge weights are handled during symmetrization:
ADD = weights of each arc are added MAX = only the heaviest arc weight is kept |
GRAPH_BUILD_TYPE | Type of input, do allow some optimizations in the build process:
NORMAL = graph is generic, no optimization can be performed FAST = graph global ids are in the interval [0,n-1] FAST_NO_DUP = graph global ids are in the interval [0,n-1] and there is no duplicate edges and no need of symmetrization. |
Default values: | |
CHECK_GRAPH = 1 | |
GRAPH_SYMMETRIZE = NONE | |
GRAPH_SYM_WEIGHT = ADD | |
GRAPH_BUILD_TYPE = NORMAL | |
Required Query Functions: | |
ZOLTAN_NUM_OBJ_FN | |
ZOLTAN_OBJ_LIST_FN | |
ZOLTAN_NUM_EDGES_MULTI_F
N or
ZOLTAN_NUM_EDGES_FN
ZOLTAN_EDGE_LIST_MULTI_F N or ZOLTAN_EDGE_LIST_FN |