MPI_Dist_graph_neighbors_count − Provides information about adjacency in a distributed graph topology.
#include
<mpi.h>
int MPI_Dist_graph_neighbors_count(MPI_Comm comm,
int *indegree, int *outdegree, int *weighted) |
INCLUDE
’mpif.h’
MPI_DIST_GRAPH_NEIGHBORS_COUNT(COMM, INDEGREE, OUTDEGREE, WEIGHTED, IERROR)
INTEGER |
COMM, INDEGREE, OUTDEGREE, IERROR |
|||
LOGICAL |
WEIGHTED |
#include
<mpi.h>
void Distgraphcomm::Get_dist_neighbors_count(int rank, int indegree[], int outdegree[], bool& weighted)
comm |
Communicator with distributed graph topology (handle). |
indegree |
Number of edges into this process (non-negative integer). |
|||
outdegree |
Number of edges out of this process (non-negative integer). |
|||
weighted |
True unless the topology was created with MPI_UNWEIGHTED. |
|||
IERROR |
Fortran only: Error status (integer). |