Trait graph::graph_ops::DegreePartitionOp [−][src]
pub trait DegreePartitionOp<Node: Idx> { fn degree_partition(&self, concurrency: usize) -> Vec<Range<Node>>; }
Expand description
Partition the node set based on the degrees of the nodes.
Required methods
fn degree_partition(&self, concurrency: usize) -> Vec<Range<Node>>
fn degree_partition(&self, concurrency: usize) -> Vec<Range<Node>>
Creates a range-based degree partition of the nodes.
Divide the nodes into concurrency
number of ranges such that these
ranges have roughly equal total degree. That is, the sum of the 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
.