: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.
#include <mpi.h>
int MPI_Dist_graph_neighbors_count(MPI_Comm comm, int *indegree,
int *outdegree, int *weighted)
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
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
comm
: Communicator with distributed graph topology (handle).
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).
: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.
.. seealso::
* :ref:`MPI_Dist_graph_neighbors`