9#include "AdjacencyList.h"
10#include <dolfinx/common/IndexMap.h>
47AdjacencyList<std::tuple<int, std::size_t, std::int8_t>,
48 std::pair<std::int32_t, std::int32_t>>
49comm_graph(
const common::IndexMap& map,
int root = 0);
65comm_to_json(
const AdjacencyList<std::tuple<int, std::size_t, std::int8_t>,
66 std::pair<std::int32_t, std::int32_t>>& g);
Graph data structures and algorithms.
Definition AdjacencyList.h:20
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:19
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:104