1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80
|
.. _mpi_dist_graph_neighbors_count:
MPI_Dist_graph_neighbors_count
==============================
.. include_body
:ref:`MPI_Dist_graph_neighbors_count` |mdash| 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
^^^^^^^^
.. code-block:: c
#include <mpi.h>
int MPI_Dist_graph_neighbors_count(MPI_Comm comm, int *indegree,
int *outdegree, int *weighted)
Fortran Syntax
^^^^^^^^^^^^^^
.. code-block:: fortran
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
^^^^^^^^^^^^^^^^^^^
.. code-block:: fortran
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
------
.. include:: ./ERRORS.rst
.. seealso::
* :ref:`MPI_Dist_graph_neighbors`
|