Struct Topology 

pub struct Topology { /* private fields */ }

Implementations

impl Topology

pub fn try_from_edges( node_count: usize, edges: impl IntoIterator<Item = EdgeEndpoints>, ) -> Result<Self>

Builds a validated directed topology with incoming and outgoing CSR.

Errors

Returns an error when the graph exceeds the compact index capacity or an endpoint is outside node_count.

pub const fn node_count(&self) -> usize

pub const fn edge_count(&self) -> usize

pub fn contains_node(&self, node: NodeIndex) -> bool

pub fn contains_edge(&self, edge: EdgeIndex) -> bool

pub fn edge_endpoints(&self, edge: EdgeIndex) -> Option<EdgeEndpoints>

pub fn outgoing_edges( &self, node: NodeIndex, ) -> impl DoubleEndedIterator<Item = EdgeIndex> + ExactSizeIterator + '_

pub fn incoming_edges( &self, node: NodeIndex, ) -> impl DoubleEndedIterator<Item = EdgeIndex> + ExactSizeIterator + '_

pub fn outgoing_neighbors( &self, node: NodeIndex, ) -> impl DoubleEndedIterator<Item = NodeIndex> + ExactSizeIterator + '_

pub fn incoming_neighbors( &self, node: NodeIndex, ) -> impl DoubleEndedIterator<Item = NodeIndex> + ExactSizeIterator + '_

pub fn out_degree(&self, node: NodeIndex) -> Option<usize>

pub fn in_degree(&self, node: NodeIndex) -> Option<usize>

impl Topology

pub fn traversal_cache(&self) -> TraversalCache

Derives a speed-oriented traversal cache and compresses it when useful.

pub fn traversal_cache_with(&self, storage: TraversalStorage) -> TraversalCache

Derives a traversal cache with an explicit speed/space policy.

Trait Implementations

impl Clone for Topology

fn clone(&self) -> Topology

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Topology

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Topology

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for Topology

impl From<&Topology> for TraversalCache

fn from(topology: &Topology) -> Self

Converts to this type from the input type.

impl GraphView for Topology

type Node = NodeIndex

type Edge = EdgeIndex

fn node_count(&self) -> usize

fn edge_count(&self) -> usize

fn contains_node(&self, node: NodeIndex) -> bool

fn contains_edge(&self, edge: EdgeIndex) -> bool

fn node_indices(&self) -> impl Iterator<Item = Self::Node> + '_

fn edge_indices(&self) -> impl Iterator<Item = Self::Edge> + '_

fn edge_endpoints(&self, edge: EdgeIndex) -> Option<EdgeEndpoints>

fn edge_references( &self, ) -> impl Iterator<Item = (EdgeIndex, EdgeEndpoints)> + '_

fn outgoing_edges( &self, node: NodeIndex, ) -> impl Iterator<Item = EdgeIndex> + '_

fn incoming_edges( &self, node: NodeIndex, ) -> impl Iterator<Item = EdgeIndex> + '_

impl IndexGraphView for Topology

fn node_bound(&self) -> usize

fn edge_bound(&self) -> usize

fn node_slot(node: Self::Node) -> usize

fn edge_slot(edge: Self::Edge) -> usize

impl PartialEq for Topology

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for Topology

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Topology