MPI_Dist_graph_neighbors − Provides information about adjacency in a distributed graph topology.
#include
<mpi.h>
int MPI_Dist_graph_neighbors(MPI_Comm comm,
int maxindegree, int sources[], int sourceweights[], |
||
int maxoutdegree, int destinations[], int destweights[]) |
INCLUDE
’mpif.h’
MPI_DIST_GRAPH_NEIGHBORS(COMM, MAXINDEGREE, SOURCES, SOURCEWEIGHTS,
MAXOUTDEGREE, DESTINATIONS, DESTWEIGHTS, IERROR) |
||||
INTEGER |
COMM, MAXINDEGREE, SOURCES(*), SOURCEWEIGHTS(*), |
|||
MAXOUTDEGREE, DESTINATIONS(*), DESTWEIGHTS(*), IERROR |
#include
<mpi.h>
void Distgraphcomm::Get_dist_neighbors(int maxindegree, int sources[], int sourceweights[],
int maxoutdegree, int destinations[], int destweights[]) |
comm_old |
Communicator with distributed graph topology (handle). |
||
maxindegree |
Size of sources and sourceweights arrays (non-negative integer). |
||
maxoutdegree |
Size of destinations and destweights arrays (non-negative integer). |
sources |
Process ranks for which this process is a destination. |
|||
sourceweights |
Weights of the edges into this process. |
|||
destinations |
Process ranks for which this process is a source. |
|||
destweights |
Weights of the edges out of this process. |
|||
IERROR |
Fortran only: Error status (integer). |