Skip to content

Latest commit

 

History

History
80 lines (52 loc) · 1.85 KB

MPI_Dist_graph_neighbors_count.3.rst

File metadata and controls

80 lines (52 loc) · 1.85 KB
Raw

MPI_Dist_graph_neighbors_count

:ref:`MPI_Dist_graph_neighbors_count` - Returns the number of in and out edges for the calling processes in a distributed graph topology and a flag indicating whether the distributed graph is weighted.

SYNTAX

C Syntax

#include <mpi.h>

int MPI_Dist_graph_neighbors_count(MPI_Comm comm, int *indegree,
     int *outdegree, int *weighted)

Fortran Syntax

USE MPI
! or the older form: INCLUDE 'mpif.h'
MPI_DIST_GRAPH_NEIGHBORS_COUNT(COMM, INDEGREE, OUTDEGREE, WEIGHTED, IERROR)
     INTEGER COMM, INDEGREE, OUTDEGREE, IERROR
        LOGICAL WEIGHTED

Fortran 2008 Syntax

USE mpi_f08
MPI_Dist_graph_neighbors_count(comm, indegree, outdegree, weighted, ierror)
     TYPE(MPI_Comm), INTENT(IN) :: comm
     INTEGER, INTENT(IN) :: indegree, outdegree
     INTEGER, INTENT(OUT) :: weighted
     INTEGER, OPTIONAL, INTENT(OUT) :: ierror

INPUT PARAMETERS

  • comm: Communicator with distributed graph topology (handle).

OUTPUT PARAMETERS

  • indegree: Number of edges into this process (non-negative integer).
  • outdegree: Number of edges out of this process (non-negative integer).
  • weighted: False if MPI_UNWEIGHTED was supplied during creation, true otherwise (logical).
  • ierror: Fortran only: Error status (integer).

DESCRIPTION

:ref:`MPI_Dist_graph_neighbors_count` and :ref:`MPI_Graph_neighbors` provide adjacency information for a distributed graph topology. :ref:`MPI_Dist_graph_neighbors_count` returns the number of sources and destinations for the calling process.

ERRORS

.. seealso::
   * :ref:`MPI_Dist_graph_neighbors`