MPI_Graph_neighbors_count(3)

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

SYNOPSIS
     C:

          #include <mpi.h>

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


     C++:

          #include <mpi.h>

          int Graphcomm::Get_neighbors_count(
          int               rank) const


     Fortran:

          INCLUDE "mpif.h" (or USE MPI)

          INTEGER comm, rank, nneighbors, ierror

          CALL MPI_GRAPH_NEIGHBORS_COUNT(comm, rank,  nneighbors, 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_neighbors_count routine returns the number of neighbors of
     a node associated with a graph topology.  This routine accepts the
     following parameters:

     comm      Specifies the communicator with graph topology (handle)

     rank      Specifies the rank of a process in a group of comm (integer)

     nneighbors
               Returns the number of neighbors of the specified process
               (integer)
     ierror    Specifies the return code value for successful completion,
               which is in MPI_SUCCESS.  MPI_SUCCESS is defined in the mpif.h
               file.