Create a topological communicator with a graph topology, where any rank can be connected to any other rank. See GraphCommunicator(Intracommunicator, array<array<Int32>[]()[]>[]()[], Boolean).

Namespace:  MPI
Assembly:  MPI (in MPI.dll)
Version: 1.0.0.0 (1.0.0.0)

Syntax

C#
public static int MPI_Graph_create(
	int comm,
	int nnodes,
	int* index,
	int* edges,
	int reorder,
	int* newComm
)
Visual Basic (Declaration)
Public Shared Function MPI_Graph_create ( _
	comm As Integer, _
	nnodes As Integer, _
	index As Integer*, _
	edges As Integer*, _
	reorder As Integer, _
	newComm As Integer* _
) As Integer
Visual C++
public:
static int MPI_Graph_create(
	int comm, 
	int nnodes, 
	int* index, 
	int* edges, 
	int reorder, 
	int* newComm
)

Parameters

comm
Type: System..::.Int32
An existing Intracommunicator to use to create the new communicator.
nnodes
Type: System..::.Int32
The number of nodes the graph will have.
index
Type: System..::.Int32 *
An array indicating the starting index in edges of the edges for each vertex.
edges
Type: System..::.Int32 *
An array of edge targets, indexed by index.
reorder
Type: System..::.Int32
Logical indicating whether ranks can be reordered.
newComm
Type: System..::.Int32 *
The new communicator.

See Also