Struct lib_dachshund::dachshund::typed_graph_builder::TypedGraphBuilder

pub struct TypedGraphBuilder {
    pub min_degree: Option<usize>,
    pub graph_id: GraphId,
}

In the TypedGraph world, we use the type NodeLabel as an alias for the NodeId type. Internally we represent node ids with u32s of 0…n.

Fields

min_degree: Option<usize>

graph_id: GraphId

Trait Implementations

impl GraphBuilderBase for TypedGraphBuilder

type GraphType = TypedGraph

type RowType = EdgeRow

fn from_vector(&mut self, rows: Vec<EdgeRow>) -> CLQResult<TypedGraph>

impl GraphBuilderBaseWithPreProcessing for TypedGraphBuilder

fn pre_process_rows( &mut self, data: Vec<<Self as GraphBuilderBase>::RowType> ) -> CLQResult<Vec<<Self as GraphBuilderBase>::RowType>>

impl TypedGraphBuilderBase for TypedGraphBuilder

fn create_graph( nodes: FxHashMap<u32, Node>, core_ids: Vec<u32>, non_core_ids: Vec<u32>, labels_map: FxHashMap<NodeLabel, u32> ) -> CLQResult<TypedGraph>

fn populate_edges( rows: &[EdgeRow], node_map: &mut FxHashMap<u32, Node>, labels_map: &FxHashMap<NodeLabel, u32> ) -> CLQResult<()>

given a set of initialized Nodes, populates the respective neighbors fields appropriately.

fn init_nodes( core_ids: &[NodeLabel], non_core_ids: &[NodeLabel], non_core_type_ids: &HashMap<NodeLabel, NodeTypeId> ) -> (FxHashMap<u32, Node>, FxHashMap<NodeLabel, u32>, Vec<u32>, Vec<u32>)

fn trim_edges( node_map: &mut FxHashMap<u32, Node>, min_degree: &usize ) -> HashSet<u32>

Trims edges greedily, until all edges in the graph have degree at least min_degree. Note that this function does not delete any nodes – just finds nodes to delete. It is called by prune, which actually does the deletion.

fn prune( graph: TypedGraph, rows: &[EdgeRow], min_degree: usize ) -> CLQResult<TypedGraph>

Takes an already-built graph and the edge rows used to create it, returning a new graph, where all nodes are assured to have degree at least min_degree. The provision of a ::GraphType is necessary, since the notion of “degree” does not make sense outside of a graph.

fn get_filtered_sources_targets_rows( graph: TypedGraph, min_degree: usize, rows: &[EdgeRow] ) -> (Vec<NodeLabel>, Vec<NodeLabel>, Vec<EdgeRow>)

called by prune, finds source and target nodes to exclude, as well as edges to exclude when rebuilding the graph from a filtered vector of EdgeRows.