Struct WebgraphAdapter 

pub struct WebgraphAdapter<G: SwhForwardGraph>(pub G);

Wraps a SwhForwardGraph in order to implements webgraph’s RandomAccessGraph

Example

use std::path::PathBuf;

use webgraph::prelude::VecGraph;

use swh_graph::graph::{SwhForwardGraph, SwhUnidirectionalGraph};
use swh_graph::views::WebgraphAdapter;

fn get_graph() -> impl SwhForwardGraph {
    // loads this graph:
    // 1 --.
    // |    \
    // v     v
    // 0 --> 2
    SwhUnidirectionalGraph::new("./example").unwrap()
}

let graph = get_graph();
let adapter = WebgraphAdapter(graph);

// We can now call generic webgraph algorithms on the adapter
let order = webgraph::algo::BfsOrder::new(&adapter);
assert_eq!(order.collect::<Vec<_>>(), vec![0, 2, 1]);

Tuple Fields

0: G

Trait Implementations

impl<G: SwhForwardGraph> RandomAccessGraph for WebgraphAdapter<G>

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<G: SwhForwardGraph> RandomAccessLabeling for WebgraphAdapter<G>

type Labels<'succ> = <G as SwhForwardGraph>::Successors<'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 outdegree(&self, node_id: usize) -> usize

Returns the number of labels associated with a node.

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

Returns the labels associated with a node.

impl<G: SwhForwardGraph> SequentialLabeling for WebgraphAdapter<G>

type Label = usize

type Lender<'node> = LenderSwhForwardGraph<'node, G> 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 num_arcs_hint(&self) -> Option<u64>

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

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

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

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<G: SwhForwardGraph> SequentialGraph for WebgraphAdapter<G>