Struct GraphProjection 

pub struct GraphProjection { /* private fields */ }

Materialized binary graph projection.

This view exposes OxGraph canonical topology through oxgraph-graph traits. Outgoing arrays are CSR-shaped; incoming arrays are CSC-shaped.

Performance

Cloning is O(n + m) for visible nodes and edges. Traversal is O(k) for each yielded adjacency list.

Implementations

impl GraphProjection

pub const fn definition(&self) -> &GraphProjectionDefinition

Returns the definition used for this projection.

Performance

This method is O(1).

Trait Implementations

impl CanonicalElementIdentity for GraphProjection

type CanonicalElementId = ElementId

Canonical element ID guaranteed by this view.

fn canonical_element_id( &self, element: Self::ElementId, ) -> Self::CanonicalElementId

Returns the canonical ID for a visible local element.

impl CanonicalRelationIdentity for GraphProjection

type CanonicalRelationId = RelationId

Canonical relation ID guaranteed by this view.

fn canonical_relation_id( &self, relation: Self::RelationId, ) -> Self::CanonicalRelationId

Returns the canonical ID for a visible local relation.

impl Clone for GraphProjection

fn clone(&self) -> GraphProjection

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl ContainsElement for GraphProjection

fn contains_element(&self, element: Self::ElementId) -> bool

Returns whether element is valid and visible in this view.

impl ContainsRelation for GraphProjection

fn contains_relation(&self, relation: Self::RelationId) -> bool

Returns whether relation is valid and visible in this view.

impl Debug for GraphProjection

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl EdgeSourceGraph for GraphProjection

fn source(&self, edge: Self::RelationId) -> Self::ElementId

Returns the source node of edge. edge must be a valid edge ID.

impl EdgeTargetGraph for GraphProjection

fn target(&self, edge: Self::RelationId) -> Self::ElementId

Returns the target node of edge. edge must be a valid edge ID.

impl ElementIndex for GraphProjection

fn element_bound(&self) -> usize

Returns the exclusive upper bound for element indexes in this view.

fn element_index(&self, element: Self::ElementId) -> usize

Returns the dense index for element in this view.

impl ElementPredecessors for GraphProjection

type Predecessors<'view> = Copied<Iter<'view, ProjectionElementId>> where Self: 'view

Iterator over predecessor element IDs reaching one element.

fn element_predecessors( &self, element: Self::ElementId, ) -> Self::Predecessors<'_>

Returns elements that reach element through outgoing connections.

impl ElementSuccessors for GraphProjection

type Successors<'view> = Copied<Iter<'view, ProjectionElementId>> where Self: 'view

Iterator over successor element IDs reached from one element.

fn element_successors(&self, element: Self::ElementId) -> Self::Successors<'_>

Returns elements reachable through outgoing connections from element.

impl Eq for GraphProjection

impl GraphCounts for GraphProjection

fn node_count(&self) -> usize

Returns the number of nodes visible in this graph view.

fn edge_count(&self) -> usize

Returns the number of edges visible in this graph view.

impl IncomingEdgeCount for GraphProjection

fn in_degree(&self, node: Self::ElementId) -> usize

Returns the number of edges entering node.

impl IncomingGraph for GraphProjection

type InEdges<'view> = Copied<Iter<'view, ProjectionRelationId>> where Self: 'view

Iterator over edge IDs entering one target node.

fn incoming_edges(&self, node: Self::ElementId) -> Self::InEdges<'_>

Returns edges whose target is node.

impl LocalElementIdentity for GraphProjection

fn local_element_id( &self, canonical: Self::CanonicalElementId, ) -> Option<Self::ElementId>

Returns the visible local element for canonical, if present.

impl LocalRelationIdentity for GraphProjection

fn local_relation_id( &self, canonical: Self::CanonicalRelationId, ) -> Option<Self::RelationId>

Returns the visible local relation for canonical, if present.

impl OutgoingEdgeCount for GraphProjection

fn out_degree(&self, node: Self::ElementId) -> usize

Returns the number of edges leaving node.

impl OutgoingGraph for GraphProjection

type OutEdges<'view> = Copied<Iter<'view, ProjectionRelationId>> where Self: 'view

Iterator over edge IDs leaving one source node.

fn outgoing_edges(&self, node: Self::ElementId) -> Self::OutEdges<'_>

Returns edges whose source is node.

impl PartialEq for GraphProjection

fn eq(&self, other: &GraphProjection) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl RelationIndex for GraphProjection

fn relation_bound(&self) -> usize

Returns the exclusive upper bound for relation indexes in this view.

fn relation_index(&self, relation: Self::RelationId) -> usize

Returns the dense index for relation in this view.

impl StructuralPartialEq for GraphProjection

impl TopologyBase for GraphProjection

type ElementId = ProjectionElementId

Identity of a topology element.

type RelationId = ProjectionRelationId

Identity of a topology relation.

impl TopologyCounts for GraphProjection

fn element_count(&self) -> usize

Returns the number of elements visible in this topology view.

fn relation_count(&self) -> usize

Returns the number of relations visible in this topology view.