Struct AcyclicPayloadGraph 

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

A stable mutable payload graph that rejects cycle-creating mutations.

Implementations

impl<NodePayload, EdgePayload> AcyclicPayloadGraph<NodePayload, EdgePayload>

pub const fn new() -> Self

pub fn try_from_graph( graph: StablePayloadGraph<NodePayload, EdgePayload>, ) -> Result<Self>

Wraps an existing graph after validating the DAG invariant.

Errors

Returns an error if the input contains a directed cycle.

pub fn add_node(&mut self, payload: NodePayload) -> Result<StableNodeKey>

Adds an arbitrary node payload.

Errors

Returns an error when stable index capacity is exhausted.

pub fn add_edge( &mut self, source: StableNodeKey, target: StableNodeKey, payload: EdgePayload, ) -> Result<StableEdgeKey>

Adds an edge only when the graph remains acyclic.

Errors

Returns an error for stale endpoints, exhausted capacity, or a cycle.

pub fn set_edge_endpoints( &mut self, edge: StableEdgeKey, source: StableNodeKey, target: StableNodeKey, ) -> Result<bool>

Retargets an edge only when the graph remains acyclic.

Errors

Returns an error for stale endpoints or a cycle.

pub fn remove_node(&mut self, key: StableNodeKey) -> Option<NodePayload>

pub fn remove_edge(&mut self, key: StableEdgeKey) -> Option<EdgePayload>

pub fn node(&self, key: StableNodeKey) -> Option<&NodePayload>

pub fn node_mut(&mut self, key: StableNodeKey) -> Option<&mut NodePayload>

pub fn edge(&self, key: StableEdgeKey) -> Option<&EdgePayload>

pub fn edge_mut(&mut self, key: StableEdgeKey) -> Option<&mut EdgePayload>

pub const fn graph(&self) -> &StablePayloadGraph<NodePayload, EdgePayload>

pub fn into_inner(self) -> StablePayloadGraph<NodePayload, EdgePayload>

Trait Implementations

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

fn clone(&self) -> AcyclicPayloadGraph<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 AcyclicPayloadGraph<NodePayload, EdgePayload>

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

Formats the value using the given formatter.

impl<NodePayload: Default, EdgePayload: Default> Default for AcyclicPayloadGraph<NodePayload, EdgePayload>

fn default() -> AcyclicPayloadGraph<NodePayload, EdgePayload>

Returns the “default value” for a type.

impl<NodePayload, EdgePayload> GraphView for AcyclicPayloadGraph<NodePayload, EdgePayload>

type Node = StableNodeKey

type Edge = StableEdgeKey

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 outgoing_edges( &self, node: Self::Node, ) -> impl Iterator<Item = Self::Edge> + '_

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

fn edge_references( &self, ) -> impl Iterator<Item = (Self::Edge, EdgeEndpoints<Self::Node>)> + '_

impl<NodePayload, EdgePayload> IndexGraphView for AcyclicPayloadGraph<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