Struct Cost 

pub struct Cost {
    pub offsets: u64,
    pub degrees: u64,
    pub firsts: u64,
    pub widths: u64,
    pub gaps: u64,
    pub patches: u64,
    pub groups: u64,
    pub slack: u64,
}

Where the bits went, in bits.

A compressed structure that cannot say which part of itself is expensive is very hard to improve, and the answer moves a lot between graphs: on a graph with an average degree of sixteen the per node fields are a fifth of the total, and on one with an average degree of three they are most of it. Csr::cost returns this and the compress example prints it.

Fields

offsets: u64

The per node bit offset tables.

degrees: u64

One degree per node, including the nodes that have no edges.

firsts: u64

One first neighbour per node that has any.

widths: u64

The header in front of every block of gaps: the width, whether anything did not fit it, and how much of it did not.

gaps: u64

The gaps, which is the only part that is really the graph.

patches: u64

The gaps that did not fit their block’s width, written again at the end of the block with the position they belong at.

groups: u64

The fixed group records, which are not in the bit stream at all.

slack: u64

Whatever rounding the stream up to whole words left over.

Implementations

impl Cost

pub fn total(&self) -> u64

Everything, which is Csr::bytes in bits and to the bit.

Trait Implementations

impl Clone for Cost

fn clone(&self) -> Cost

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for Cost

impl Debug for Cost

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Cost

fn default() -> Cost

Returns the “default value” for a type.

impl Eq for Cost

impl PartialEq for Cost

fn eq(&self, other: &Cost) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Cost