Defined in File GraphClusteringTools.hpp
Get the communication graph for a given graph and its partition. A communication graph consists of a number of nodes, which equal the number of clusters in the partition. The edges between nodes in the communication graph account for the total edge weight for all edges between two clusters. For unweighted graphs, the edge weight in the communication graph is equal to the number of edges between two clusters.
graph – The input graph
zeta – Partition, which contains information about clusters in the graph
communication graph