Struct Graph 

pub struct Graph { /* private fields */ }

Implementations

impl Graph

pub fn try_from_parts( nodes: impl IntoIterator<Item = Node>, edges: impl IntoIterator<Item = Edge>, ) -> Result<Self>

Creates a validated graph and canonicalizes its ordering.

Errors

Returns an error for conflicting nodes, dangling edges, empty extractor identities, or invalid source spans.

pub fn try_from_sorted_nodes( nodes: Vec<Node>, edges: impl IntoIterator<Item = Edge>, ) -> Result<Self>

Builds a canonical graph without re-sorting already sorted nodes.

Unsorted nodes safely fall back to Self::try_from_parts. Edges may arrive in any order and are still validated, sorted, and deduplicated.

Errors

Returns the same validation errors as Self::try_from_parts.

pub fn try_from_sorted_parts(nodes: Vec<Node>, edges: Vec<Edge>) -> Result<Self>

Builds faster when nodes and edges are already in canonical order.

Unordered input safely falls back to Self::try_from_parts.

Errors

Returns the same validation errors as Self::try_from_parts.

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

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

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

pub fn node(&self, id: &str) -> Option<&Node>

pub fn outgoing<'graph>( &'graph self, id: &NodeId, ) -> impl Iterator<Item = &'graph Edge>

pub fn incoming<'graph>( &'graph self, id: &NodeId, ) -> impl Iterator<Item = &'graph Edge>

pub fn edge_at(&self, index: EdgeIndex) -> Option<&Edge>

pub fn node_index(&self, id: &str) -> Option<GraphNodeIndex>

pub fn node_at(&self, index: GraphNodeIndex) -> Option<&Node>

pub fn outgoing_at(&self, index: GraphNodeIndex) -> impl Iterator<Item = &Edge>

pub fn incoming_at(&self, index: GraphNodeIndex) -> impl Iterator<Item = &Edge>

pub fn outgoing_neighbors_at( &self, index: GraphNodeIndex, ) -> impl Iterator<Item = GraphNodeIndex> + '_

pub fn incoming_neighbors_at( &self, index: GraphNodeIndex, ) -> impl Iterator<Item = GraphNodeIndex> + '_

pub fn out_degree(&self, index: GraphNodeIndex) -> Option<usize>

pub fn in_degree(&self, index: GraphNodeIndex) -> Option<usize>

pub const fn node_count(&self) -> usize

pub const fn edge_count(&self) -> usize

pub const fn is_empty(&self) -> bool

pub fn into_parts(self) -> (Vec<Node>, Vec<Edge>)

impl Graph

pub fn traversal_cache(&self) -> TraversalCache

Derives an optional traversal cache without changing evidence storage.

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

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

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Graph

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

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for Graph

impl From<&Graph> for TraversalCache

fn from(graph: &Graph) -> Self

Converts to this type from the input type.

impl GraphView for Graph

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 Graph

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 Graph

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for Graph

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 Graph

impl TryFrom<LegacyGraph> for Graph

type Error = GraphError

The type returned in the event of a conversion error.

fn try_from(value: LegacyGraph) -> Result<Self>

Performs the conversion.