Struct swh_graph::views::Subgraph

pub struct Subgraph<G: SwhGraph, NodeFilter: Fn(usize) -> bool, ArcFilter: Fn(usize, usize) -> bool> {
    pub graph: G,
    pub node_filter: NodeFilter,
    pub arc_filter: ArcFilter,
}

A view over SwhGraph and related traits, that filters out some nodes and arcs based on arbitrary closures.

Fields

graph: G

node_filter: NodeFilter

arc_filter: ArcFilter

Implementations

impl<G: SwhGraph, NodeFilter: Fn(usize) -> bool> Subgraph<G, NodeFilter, fn(_: usize, _: usize) -> bool>

pub fn new_with_node_filter( graph: G, node_filter: NodeFilter ) -> Subgraph<G, NodeFilter, fn(_: usize, _: usize) -> bool>

Shorthand for Subgraph { graph, node_filter, arc_filter: |_src, _dst| true }

impl<G: SwhGraph, ArcFilter: Fn(usize, usize) -> bool> Subgraph<G, fn(_: usize) -> bool, ArcFilter>

pub fn new_with_arc_filter( graph: G, arc_filter: ArcFilter ) -> Subgraph<G, fn(_: usize) -> bool, ArcFilter>

Shorthand for Subgraph { graph, node_filter: |_node| true, arc_filter }

Trait Implementations

impl<G: SwhBackwardGraph, NodeFilter: Fn(usize) -> bool, ArcFilter: Fn(usize, usize) -> bool> SwhBackwardGraph for Subgraph<G, NodeFilter, ArcFilter>

type Predecessors<'succ> = FilteredPredecessors<'succ, <<G as SwhBackwardGraph>::Predecessors<'succ> as IntoIterator>::IntoIter, NodeFilter, ArcFilter> where Self: 'succ

fn predecessors(&self, node_id: NodeId) -> Self::Predecessors<'_>

Return an IntoIterator over the predecessors of a node.

fn indegree(&self, node_id: NodeId) -> usize

Return the number of predecessors of a node.

impl<G: SwhForwardGraph, NodeFilter: Fn(usize) -> bool, ArcFilter: Fn(usize, usize) -> bool> SwhForwardGraph for Subgraph<G, NodeFilter, ArcFilter>

type Successors<'succ> = FilteredSuccessors<'succ, <<G as SwhForwardGraph>::Successors<'succ> as IntoIterator>::IntoIter, NodeFilter, ArcFilter> where Self: 'succ

fn successors(&self, node_id: NodeId) -> Self::Successors<'_>

Return an IntoIterator over the successors of a node.

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

Return the number of successors of a node.

impl<G: SwhGraph, NodeFilter: Fn(usize) -> bool, ArcFilter: Fn(usize, usize) -> bool> SwhGraph for Subgraph<G, NodeFilter, ArcFilter>

fn path(&self) -> &Path

Return the base path of the graph

fn is_transposed(&self) -> bool

Returns whether the graph is in the ori->snp->rel,rev->dir->cnt direction (with a few dir->rev arcs)

fn num_nodes(&self) -> usize

Return the number of nodes in the graph.

fn has_node(&self, node_id: NodeId) -> bool

Returns whether the given node id exists in the graph

fn num_arcs(&self) -> u64

Return the number of arcs in the graph.

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

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

impl<G: SwhGraphWithProperties, NodeFilter: Fn(usize) -> bool, ArcFilter: Fn(usize, usize) -> bool> SwhGraphWithProperties for Subgraph<G, NodeFilter, ArcFilter>

type Maps = <G as SwhGraphWithProperties>::Maps

type Timestamps = <G as SwhGraphWithProperties>::Timestamps

type Persons = <G as SwhGraphWithProperties>::Persons

type Contents = <G as SwhGraphWithProperties>::Contents

type Strings = <G as SwhGraphWithProperties>::Strings

type LabelNames = <G as SwhGraphWithProperties>::LabelNames

fn properties( &self ) -> &SwhGraphProperties<Self::Maps, Self::Timestamps, Self::Persons, Self::Contents, Self::Strings, Self::LabelNames>

impl<G: SwhLabelledBackwardGraph, NodeFilter: Fn(usize) -> bool, ArcFilter: Fn(usize, usize) -> bool> SwhLabelledBackwardGraph for Subgraph<G, NodeFilter, ArcFilter>

type LabelledArcs<'arc> = <G as SwhLabelledBackwardGraph>::LabelledArcs<'arc> where Self: 'arc

type LabelledPredecessors<'node> = FilteredLabelledPredecessors<'node, <Subgraph<G, NodeFilter, ArcFilter> as SwhLabelledBackwardGraph>::LabelledArcs<'node>, <<G as SwhLabelledBackwardGraph>::LabelledPredecessors<'node> as IntoIterator>::IntoIter, NodeFilter, ArcFilter> where Self: 'node

fn labelled_predecessors( &self, node_id: NodeId ) -> Self::LabelledPredecessors<'_>

Return an IntoIterator over the successors of a node.

impl<G: SwhLabelledForwardGraph, NodeFilter: Fn(usize) -> bool, ArcFilter: Fn(usize, usize) -> bool> SwhLabelledForwardGraph for Subgraph<G, NodeFilter, ArcFilter>

type LabelledArcs<'arc> = <G as SwhLabelledForwardGraph>::LabelledArcs<'arc> where Self: 'arc

type LabelledSuccessors<'node> = FilteredLabelledSuccessors<'node, <Subgraph<G, NodeFilter, ArcFilter> as SwhLabelledForwardGraph>::LabelledArcs<'node>, <<G as SwhLabelledForwardGraph>::LabelledSuccessors<'node> as IntoIterator>::IntoIter, NodeFilter, ArcFilter> where Self: 'node

fn labelled_successors(&self, node_id: NodeId) -> Self::LabelledSuccessors<'_>

Return an IntoIterator over the successors of a node.