NAME
MMPPIIGGrraapphhccrreeaattee - Makes a new communicator to which topology informa-
tion has been attached. SSYYNNTTAAXX CC SSyynnttaaxx#include
int MPIGraphcreate(MPIComm commold, int nnodes, int *index, int *edges, int reorder, MPIComm *commgraph) FFoorrttrraann SSyynnttaaxx INCLUDE 'mpif.h' MPIGRAPHCREATE(COMMOLD, NNODES, INDEX, EDGES, REORDER,COMMGRAPH, IERROR)
INTEGER COMMOLD, NNODES, INDEX(*), EDGES(*)INTEGER COMMGRAPH, IERROR
LOGICAL REORDER CC++++ SSyynnttaaxx#include
Graphcomm Intracomm::Creategraph(int nnodes, const int index[], const int edges[], bool reorder) const IINNPPUUTT PPAARRAAMMEETTEERRSS commold Input communicator without topology (handle). nnodes Number of nodes in graph (integer). index Array of integers describing node degrees (see below). edges Array of integers describing graph edges (see below). reorder Ranking may be reordered (true) or not (false) (logical). OOUUTTPPUUTT PPAARRAAMMEETTEERRSS commgraph Communicator with graph topology added (handle).IERROR Fortran only: Error status (integer).
DESCRIPTION
MPIGraphcreate returns a handle to a new communicator to which the graph topology information is attached. If reorder = false then the rank of each process in the new group is identical to its rank in the old group. Otherwise, the function may reorder the processes. If the size, nnodes, of the graph is smaller than the size of the group of commold, then some processes are returned MPICOMMNULL, in analogy toMPICartcreate and MPICommsplit. The call is erroneous if it speci-
fies a graph that is larger than the group size of the input communica-
tor.The three parameters nnodes, index, and edges define the graph struc-
ture. nnodes is the number of nodes of the graph. The nodes are num-
bered from 0 to nnodes-1. The ith entry of array index stores the total
number of neighbors of the first i graph nodes. The lists of neighborsof nodes 0, 1, ..., nnodes-1 are stored in consecutive locations in
array edges. The array edges is a flattened representation of the edge lists. The total number of entries in index is nnodes and the total number of entries in edges is equal to the number of graph edges.The definitions of the arguments nnodes, index, and edges are illus-
trated with the following simple example. EExxaammppllee:: Assume there are four processes 0, 1, 2, 3 with the following adjacency matrix: Process Neighbors 0 1, 3 1 0 2 3 3 0, 2 Then, the input arguments are: nnodes = 4 index = 2, 3, 4, 6 edges = 1, 3, 0, 3, 0, 2Thus, in C, index[0] is the degree of node zero, and index[i] -
index[i-1] is the degree of node i, i=1, . . . , nnodes-1; the list of
neighbors of node zero is stored in edges[j], for 0 <= j <= index[0] -
1 and the list of neighbors of node i, i > 0 , is stored in edges[j],index[i-1] <= j <= index[i] - 1.
In Fortran, index(1) is the degree of node zero, and index(i+1) -
index(i) is the degree of node i, i=1, . . . , nnodes-1; the list of
neighbors of node zero is stored in edges(j), for 1 <= j <= index(1) and the list of neighbors of node i, i > 0, is stored in edges(j), index(i) + 1 <= j <= index(i + 1). EERRRROORRSS Almost all MPI routines return an error value; C routines as the valueof the function and Fortran routines in the last argument. C++ func-
tions do not return errors. If the default error handler is set toMPI::ERRORSTHROWEXCEPTIONS, then on error the C++ exception mechanism
will be used to throw an MPI:Exception object. Before the error value is returned, the current MPI error handler is called. By default, this error handler aborts the MPI job, except for I/O function errors. The error handler may be changed withMPICommseterrhandler; the predefined error handler MPIERRORSRETURN
may be used to cause error values to be returned. Note that MPI does not guarantee that an MPI program can continue past an error.SEE ALSO
MPIGraphget MPIGraphdimsget Open MPI 1.2 September 2006 MPIGraphcreate(3OpenMPI)