MPI_Graph_neighbors - Returns the neighbors of a node
       associated with a graph topology


SYNOPSIS

       C:

            #include <mpi.h>

            int MPI_Graph_neighbors ( comm, rank, maxneighbors,
            neighbors )
            MPI_Comm  comm;
            int       rank;
            int      maxneighbors;
            int      *neighbors;

       C++:

            #include <mpi.h>

            void Graphcomm::Get_neighbors(
            int               rank,
            int               maxneighbors,
            int               neighbors[]) const

       Fortran:

            INCLUDE "mpif.h" (or USE MPI)

            INTEGER comm, rank, maxneighbors, neighbors(*), ierror

            CALL MPI_GRAPH_NEIGHBORS(comm, rank, maxneighbors, neighbors(*), 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 routine returns the 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)

       maxneighbors   Specifies the size of array neighbors
                      (integer)

                      neighbors to a specified process (integer
                      array)

       ierror         Specifies the return code value for
                      successful completion, which is in
                      MPI_SUCCESS.  MPI_SUCCESS is defined in the
                      mpif.h file.


Man(1) output converted with man2html