Struct DefaultUnderlyingGraph 

pub struct DefaultUnderlyingGraph(pub BvGraph<DynCodesDecoderFactory<BE, MmapHelper<u32>, EliasFano<SelectAdaptConst<BitVec<&'static [usize]>, &'static [usize], 12, 4>, BitFieldVec<usize, &'static [usize]>>>>);

Newtype for BvGraph with its type parameters set to what the SWH graph needs.

This indirection reduces the size of error messages.

Tuple Fields

0: BvGraph<DynCodesDecoderFactory<BE, MmapHelper<u32>, EliasFano<SelectAdaptConst<BitVec<&'static [usize]>, &'static [usize], 12, 4>, BitFieldVec<usize, &'static [usize]>>>>

Implementations

impl DefaultUnderlyingGraph

pub fn new(basepath: impl AsRef<Path>) -> Result<DefaultUnderlyingGraph>

Trait Implementations

impl RandomAccessGraph for DefaultUnderlyingGraph

fn successors(&self, node_id: usize) -> Self::Labels<'_>

Returns the successors of a node.

fn labels(&self, _node_id: usize) -> Self::Labels<'_>

where this_method_cannot_be_called_use_successors_instead: for<'a> Clone,

Disabling override of the RandomAccessLabeling::labels method.

fn has_arc(&self, src_node_id: usize, dst_node_id: usize) -> bool

Returns whether there is an arc going from src_node_id to dst_node_id.

impl RandomAccessLabeling for DefaultUnderlyingGraph

type Labels<'succ> = <BvGraph<DynCodesDecoderFactory<BigEndian, MmapHelper<u32>, EliasFano<SelectAdaptConst<BitVec<&'static [usize]>, &'static [usize], 12, 4>, BitFieldVec<usize, &'static [usize]>>>> as RandomAccessLabeling>::Labels<'succ> where Self: 'succ

The type of the iterator over the labels of a node returned by labels.

fn num_arcs(&self) -> u64

Returns the number of arcs in the graph.

fn labels(&self, node_id: usize) -> <Self as RandomAccessLabeling>::Labels<'_>

Returns the labels associated with a node.

fn outdegree(&self, node_id: usize) -> usize

Returns the number of labels associated with a node.

impl SequentialLabeling for DefaultUnderlyingGraph

type Label = <BvGraph<DynCodesDecoderFactory<BigEndian, MmapHelper<u32>, EliasFano<SelectAdaptConst<BitVec<&'static [usize]>, &'static [usize], 12, 4>, BitFieldVec<usize, &'static [usize]>>>> as SequentialLabeling>::Label

type Lender<'node> = <BvGraph<DynCodesDecoderFactory<BigEndian, MmapHelper<u32>, EliasFano<SelectAdaptConst<BitVec<&'static [usize]>, &'static [usize], 12, 4>, BitFieldVec<usize, &'static [usize]>>>> as SequentialLabeling>::Lender<'node> where Self: 'node

The type of Lender over the successors of a node returned by iter.

fn num_nodes(&self) -> usize

Returns the number of nodes in the graph.

fn iter_from(&self, from: usize) -> Self::Lender<'_>

Returns an iterator over the labeling starting at from (included).

fn num_arcs_hint(&self) -> Option<u64>

Returns the number of arcs in the graph, if available.

fn iter(&self) -> Self::Lender<'_>

Returns an iterator over the labeling.

fn par_node_apply<A, F, R>( &self, func: F, fold: R, granularity: Granularity, thread_pool: &ThreadPool, pl: &mut impl ConcurrentProgressLog, ) -> A

where A: Default + Send, F: Fn(Range<usize>) -> A + Sync, R: Fn(A, A) -> A + Sync,

Applies func to each chunk of nodes of size node_granularity in parallel, and folds the results using fold.

fn par_apply<F, A, R, D>( &self, func: F, fold: R, granularity: Granularity, deg_cumul: &D, thread_pool: &ThreadPool, pl: &mut impl ConcurrentProgressLog, ) -> A

where F: Fn(Range<usize>) -> A + Sync, A: Default + Send, R: Fn(A, A) -> A + Sync, D: Succ<Input = usize, Output = usize>,

Apply func to each chunk of nodes containing approximately arc_granularity arcs in parallel and folds the results using fold.

impl UnderlyingGraph for DefaultUnderlyingGraph

type UnlabeledSuccessors<'succ> = <BvGraph<DynCodesDecoderFactory<BigEndian, MmapHelper<u32>, EliasFano<SelectAdaptConst<BitVec<&'static [usize]>, &'static [usize], 12, 4>, BitFieldVec<usize, &'static [usize]>>>> as RandomAccessLabeling>::Labels<'succ> where Self: 'succ

fn num_arcs(&self) -> u64

Workaround for some implementations of <Self as RandomAccessLabeling>::num_arcs being missing

fn has_arc(&self, src_node_id: NodeId, dst_node_id: NodeId) -> bool

fn unlabeled_successors(&self, node_id: NodeId) -> Self::UnlabeledSuccessors<'_>

impl SequentialGraph for DefaultUnderlyingGraph