graphdot.graph.reorder.pbr package

graphdot.graph.reorder.pbr.pbr(g, partitioner=None)

Compute a partition-based permutation of a graph that minimizes the number of cross-tile messages. Note that the method does NOT modify the graph, but rather just returns a permutation vector that can be used by Graph.permute to achieve the actual reordering.

Parameters:g (graphdot.Graph) – The graph to be reordered. Returns:perm – Array of permuted node indices. Return type:numpy.ndarray

Submodules

• graphdot.graph.reorder.pbr.colnet_hypergraph module
• graphdot.graph.reorder.pbr.config module
• graphdot.graph.reorder.pbr.hypergraph module
• graphdot.graph.reorder.pbr.mnom module