Struct GraphIndex 

pub struct GraphIndex {
    pub topology: Arc<Topology>,
    pub ids: Arc<IdMap>,
    /* private fields */
}

A built graph: its topology, and the map from dense node indexes back to the edges’ ids.

Fields

topology: Arc<Topology>

ids: Arc<IdMap>

Implementations

impl GraphIndex

pub fn new(topology: Arc<Topology>, ids: Arc<IdMap>) -> Self

pub fn with_stored_weights( self, keys: Vec<String>, read: Box<dyn Fn(&str) -> Option<Vec<Vec<f64>>> + Send + Sync>, ) -> Self

This index, with the weight sets stored on disk under keys, which read reads when one is first asked for.

pub fn weights(&self, key: &str) -> Option<Weights>

The weight columns stored under key in memory, if they are.

pub fn has_stored_weights(&self, key: &str) -> bool

Whether weights are stored under key on disk.

pub fn stored_weights(&self, key: &str, n_columns: usize) -> Option<Weights>

The weight columns stored under key, in memory or else on disk, if they are and have n_columns columns of one value per edge row. Read from disk, they are kept in memory too. Blocking: it may read a file.

pub fn weight_sets(&self) -> Vec<(String, Weights)>

Every set of weight columns held in memory, with its key.

pub fn store_weights(&self, key: String, weights: Weights)

Store weight columns under key. They must be one per edge row of this index, in its edge-row order.

Trait Implementations

impl Debug for GraphIndex

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

Formats the value using the given formatter.