Struct GraphHub 

pub struct GraphHub {
    pub id: String,
    pub label: String,
    pub degree: usize,
}

A well-connected concept, for the entry list.

Fields

id: String

The concept id.

label: String

Its title.

degree: usize

How many distinct concepts this one is linked to, in either direction.

Distinct neighbours rather than a link count, and undirected, because this ranks how connected a concept is rather than how much it links: a concept naming the same target six times is one connection, and a bundle ranked the other way would put its most repetitive documents on top.

Trait Implementations

impl Clone for GraphHub

fn clone(&self) -> GraphHub

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphHub

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

Formats the value using the given formatter.

impl Serialize for GraphHub

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.