Struct ServeGraph 

pub struct ServeGraph {
    pub idf_cache: HashMap<String, f64>,
    pub bm25_index: Option<Bm25Index>,
    /* private fields */
}

Fields

idf_cache: HashMap<String, f64>

bm25_index: Option<Bm25Index>

Implementations

impl ServeGraph

pub fn new_undirected() -> Self

pub fn build_bm25_index(&mut self)

pub fn bm25(&self) -> Option<&Bm25Index>

pub fn new_directed() -> Self

pub fn add_node( &mut self, id: &str, label: &str, source_file: &str, source_location: &str, community: Option<i64>, )

pub fn add_edge( &mut self, source: &str, target: &str, relation: &str, confidence: &str, context: Option<&str>, )

pub fn neighbors(&self, n: &str) -> &[String]

pub fn degree(&self, n: &str) -> usize

pub fn num_nodes(&self) -> usize

pub fn num_edges(&self) -> usize

pub fn get_node(&self, id: &str) -> Option<&ServeNode>

pub fn get_edge_data(&self, u: &str, v: &str) -> Option<&ServeEdge>

pub fn nodes_iter(&self) -> impl Iterator<Item = (&str, &ServeNode)>

pub fn edges_iter(&self) -> impl Iterator<Item = &ServeEdge>

pub fn contains_node(&self, id: &str) -> bool

pub fn clone_nodes_only(&self) -> Self