MPI_Graph_map - Maps a process to graph topology
information
SYNOPSIS
C:
#include <mpi.h>
int MPI_Graph_map ( comm, nnodes, index,
edges, newrank )
MPI_Comm comm;
int nnodes;
int *index;
int *edges;
int *newrank;
C++:
#include <mpi.h>
int Graphcomm::Map(
int nnodes,
const int index[],
const int edges[]) const
Fortran:
INCLUDE "mpif.h" (or USE MPI)
INTEGER comm, nnodes, index(*), edges(*), newrank, ierror
CALL MPI_GRAPH_MAP(comm, nnodes, index(*), edges(*), newrank, ierror)
STANDARDS
This release implements the MPI 1.2 standard, as
documented by the MPI Forum in the spring 1997 release of
MPI: A Message Passing Interface Standard.
DESCRIPTION
The MPI_Graph_map routine maps a process to graph topology
information. This routine accepts the following
parameters:
comm Specifies the input communicator (handle).
nnodes Specifies the number of graph nodes (integer).
index Specifies an integer array specifying the graph
structure (see MPI_Graph_create(3)).
structure.
newrank Returns the reordered rank of the calling
process. If the calling process does not belong
to the graph, newrank returns MPI_UNDEFINED
(integer).
ierror Specifies the return code value for successful
completion, which is in MPI_SUCCESS.
MPI_SUCCESS is defined in the mpif.h file.
SEE ALSO
MPI_Graph_create(3)
Man(1) output converted with
man2html