Skip to content

Latest commit

 

History

History
72 lines (47 loc) · 1.51 KB

MPI_Graph_neighbors_count.3.rst

File metadata and controls

72 lines (47 loc) · 1.51 KB
Raw

MPI_Graph_neighbors_count

MPI_Graph_neighbors_count Returns the number of neighbors of a node associated with a graph topology.

SYNTAX

C Syntax

#include <mpi.h>

int MPI_Graph_neighbors_count(MPI_Comm comm, int rank,
    int *nneighbors)

Fortran Syntax

USE MPI
! or the older form: INCLUDE 'mpif.h'

MPI_GRAPH_NEIGHBORS_COUNT(COMM, RANK, NNEIGHBORS, IERROR)
    INTEGER COMM, RANK, NNEIGHBORS, IERROR

Fortran 2008 Syntax

USE mpi_f08

MPI_Graph_neighbors_count(comm, rank, nneighbors, ierror)
    TYPE(MPI_Comm), INTENT(IN) :: comm
    INTEGER, INTENT(IN) :: rank
    INTEGER, INTENT(OUT) :: nneighbors
    INTEGER, OPTIONAL, INTENT(OUT) :: ierror

INPUT PARAMETERS

  • comm : Communicator with graph topology (handle).
  • rank : Rank of process in group of comm (integer).

OUTPUT PARAMETERS

  • nneighbors : Number of neighbors of specified process (integer).
  • ierror : Fortran only: Error status (integer).

DESCRIPTION

MPI_Graph_neighbors_count and MPI_Graph_neighbors provide adjacency information for a general, graph topology. MPI_Graph_neighbors_count returns the number of neighbors for the process signified by rank.

ERRORS

MPI_Graph_neighbors