9#include "AdjacencyList.h"
52 std::pair<std::int32_t, std::int32_t>>
53comm_graph(
const common::IndexMap& map,
int root = 0);
70 std::pair<std::int32_t, std::int32_t>>& g);
This class provides a static adjacency list data structure.
Definition AdjacencyList.h:41
Miscellaneous classes, functions and types.
Definition dolfinx_common.h:8
Graph data structures and algorithms.
Definition AdjacencyList.h:23
AdjacencyList< std::tuple< int, std::size_t, std::int8_t >, std::pair< std::int32_t, std::int32_t > > comm_graph(const common::IndexMap &map, int root=0)
Compute an directed graph that describes the parallel communication patterns.
Definition utils.cpp:21
std::string comm_to_json(const AdjacencyList< std::tuple< int, std::size_t, std::int8_t >, std::pair< std::int32_t, std::int32_t > > &g)
Build communication graph data as a JSON string.
Definition utils.cpp:106