Trait graph::graph_ops::InDegreePartitionOp [−][src]
pub trait InDegreePartitionOp<Node: Idx> { fn in_degree_partition(&self, concurrency: usize) -> Vec<Range<Node>>; }
Expand description
Partition the node set based on the in degrees of the nodes.
Required methods
fn in_degree_partition(&self, concurrency: usize) -> Vec<Range<Node>>
fn in_degree_partition(&self, concurrency: usize) -> Vec<Range<Node>>
Creates a range-based in degree partition of the nodes.
Divide the nodes into concurrency
number of ranges such that these
ranges have roughly equal total in degree. That is, the sum of the in
degrees of the nodes of each range should be roughly equal to the extent
that that’s actually possible.
The length of the returned vector will never exceed concurrency
.