Struct UndirectedPayloadGraph 

pub struct UndirectedPayloadGraph<NodePayload, EdgePayload> { /* private fields */ }

Implementations

impl<NodePayload, EdgePayload> UndirectedPayloadGraph<NodePayload, EdgePayload>

pub fn try_from_edges( nodes: Vec<NodePayload>, edges: impl IntoIterator<Item = (EdgeEndpoints, EdgePayload)>, ) -> Result<Self>

Builds an undirected graph with arbitrary node and edge payloads.

Errors

Returns an error for invalid compact endpoints or capacity overflow.

pub fn try_from_parts( topology: UndirectedTopology, nodes: Vec<NodePayload>, edges: Vec<EdgePayload>, ) -> Result<Self>

Reattaches payload vectors to a prebuilt undirected topology.

Errors

Returns an error when either payload count differs from the topology.

pub const fn topology(&self) -> &UndirectedTopology

pub fn nodes(&self) -> &[NodePayload]

pub fn edges(&self) -> &[EdgePayload]

pub fn node(&self, index: NodeIndex) -> Option<&NodePayload>

pub fn node_mut(&mut self, index: NodeIndex) -> Option<&mut NodePayload>

pub fn edge(&self, index: EdgeIndex) -> Option<&EdgePayload>

pub fn edge_mut(&mut self, index: EdgeIndex) -> Option<&mut EdgePayload>

pub fn into_parts( self, ) -> (UndirectedTopology, Vec<NodePayload>, Vec<EdgePayload>)

Trait Implementations

impl<NodePayload: Clone, EdgePayload: Clone> Clone for UndirectedPayloadGraph<NodePayload, EdgePayload>

fn clone(&self) -> UndirectedPayloadGraph<NodePayload, EdgePayload>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<NodePayload: Debug, EdgePayload: Debug> Debug for UndirectedPayloadGraph<NodePayload, EdgePayload>

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

Formats the value using the given formatter.

impl<'de, NodePayload, EdgePayload> Deserialize<'de> for UndirectedPayloadGraph<NodePayload, EdgePayload>

where NodePayload: Deserialize<'de>, EdgePayload: Deserialize<'de>,

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

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<NodePayload: Eq, EdgePayload: Eq> Eq for UndirectedPayloadGraph<NodePayload, EdgePayload>

impl<NodePayload, EdgePayload> IndexUndirectedGraphView for UndirectedPayloadGraph<NodePayload, EdgePayload>

fn node_bound(&self) -> usize

fn edge_bound(&self) -> usize

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

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

fn incident_edge_at( &self, node: Self::Node, offset: usize, ) -> Option<Self::Edge>

impl<NodePayload: PartialEq, EdgePayload: PartialEq> PartialEq for UndirectedPayloadGraph<NodePayload, EdgePayload>

fn eq(&self, other: &UndirectedPayloadGraph<NodePayload, EdgePayload>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<NodePayload, EdgePayload> Serialize for UndirectedPayloadGraph<NodePayload, EdgePayload>

where NodePayload: Serialize, EdgePayload: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<NodePayload: PartialEq, EdgePayload: PartialEq> StructuralPartialEq for UndirectedPayloadGraph<NodePayload, EdgePayload>

impl<NodePayload, EdgePayload> UndirectedGraphView for UndirectedPayloadGraph<NodePayload, EdgePayload>

type Node = NodeIndex

type Edge = EdgeIndex

fn node_count(&self) -> usize

fn edge_count(&self) -> usize

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

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

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

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

fn edge_endpoints(&self, edge: Self::Edge) -> Option<EdgeEndpoints<Self::Node>>

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

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