Struct UndirectedTopology 

pub struct UndirectedTopology { /* private fields */ }

Implementations

impl UndirectedTopology

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

Builds an undirected topology with compact incidence CSR.

Self-loops occupy one incidence entry and report degree two.

Errors

Returns an error for capacity overflow or an endpoint outside the graph.

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 incident_edges( &self, node: NodeIndex, ) -> impl DoubleEndedIterator<Item = EdgeIndex> + ExactSizeIterator + '_

pub fn incident_edge_at( &self, node: NodeIndex, offset: usize, ) -> Option<EdgeIndex>

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

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

Trait Implementations

impl Clone for UndirectedTopology

fn clone(&self) -> UndirectedTopology

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for UndirectedTopology

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for UndirectedTopology

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

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for UndirectedTopology

impl IndexUndirectedGraphView for UndirectedTopology

fn node_bound(&self) -> usize

fn edge_bound(&self) -> usize

fn node_slot(node: NodeIndex) -> usize

fn edge_slot(edge: EdgeIndex) -> usize

fn incident_edge_at(&self, node: NodeIndex, offset: usize) -> Option<EdgeIndex>

impl PartialEq for UndirectedTopology

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for UndirectedTopology

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 UndirectedTopology

impl UndirectedGraphView for UndirectedTopology

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 = NodeIndex> + '_

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

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

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

fn opposite(&self, edge: Self::Edge, node: Self::Node) -> Option<Self::Node>