Struct Graph 

pub struct Graph { /* private fields */ }

Validated immutable graph used by every native algorithm.

Implementations

impl Graph

pub fn betweenness_centrality( &self, options: BetweennessOptions, ) -> Result<Vec<NodeScore>, GraphError>

Compute node betweenness centrality with NetworkX-compatible scaling.

pub fn edge_betweenness_centrality( &self, options: BetweennessOptions, ) -> Result<Vec<EdgeScore>, GraphError>

Compute edge betweenness centrality, retaining parallel-edge identity.

impl Graph

pub fn simple_cycles(&self, options: CycleOptions) -> CycleResult

Enumerate bounded simple cycles with in-search pruning.

impl Graph

pub fn spring_layout( &self, options: LayoutOptions, ) -> Result<Vec<NodePosition>, GraphError>

Compute deterministic Fruchterman-Reingold positions.

This exact kernel is quadratic in node count per iteration. It is intentionally explicit rather than silently switching to an approximate layout for larger graphs.

impl Graph

pub fn leiden(&self, options: LeidenOptions) -> Result<LeidenResult, GraphError>

Compute weighted Leiden communities with connected refinement.

impl Graph

pub fn louvain_communities( &self, options: LouvainOptions, ) -> Result<CommunityResult, GraphError>

Compute a deterministic weighted multi-level Louvain partition.

impl Graph

pub fn traverse( &self, options: &TraversalOptions, ) -> Result<TraversalResult, GraphError>

Execute deterministic BFS or DFS over the loaded graph.

pub fn degree( &self, node_id: impl Into<NodeId>, kind: DegreeKind, ) -> Result<NodeDegree, GraphError>

Compute one node degree.

pub fn degrees(&self, kind: DegreeKind) -> Vec<NodeDegree>

Compute degrees for all nodes in deterministic ID order.

pub fn shortest_path( &self, source: impl Into<NodeId>, target: impl Into<NodeId>, direction: TraversalDirection, allowed_labels: &BTreeSet<String>, max_depth: Option<usize>, ) -> PathResult

Find an unweighted shortest path in the loaded graph.

pub fn neighbors( &self, node_id: impl Into<NodeId>, direction: TraversalDirection, ) -> Result<Vec<NodeId>, GraphError>

Deterministic neighboring node IDs.

pub fn successors( &self, node_id: impl Into<NodeId>, ) -> Result<Vec<NodeId>, GraphError>

Deterministic successors under the graph’s direction semantics.

pub fn predecessors( &self, node_id: impl Into<NodeId>, ) -> Result<Vec<NodeId>, GraphError>

Deterministic predecessors under the graph’s direction semantics.

pub fn out_edge_ids( &self, node_id: impl Into<NodeId>, ) -> Result<Vec<EdgeId>, GraphError>

Stable IDs of outgoing edges. Undirected graphs return every incident edge exactly once.

pub fn in_edge_ids( &self, node_id: impl Into<NodeId>, ) -> Result<Vec<EdgeId>, GraphError>

Stable IDs of incoming edges. Undirected graphs return every incident edge exactly once.

pub fn incident_edge_ids( &self, node_id: impl Into<NodeId>, ) -> Result<Vec<EdgeId>, GraphError>

Stable IDs of all incident edges, with self-loops returned once.

pub fn edges_between( &self, source: impl Into<NodeId>, target: impl Into<NodeId>, direction: TraversalDirection, ) -> Result<Vec<EdgeId>, GraphError>

All stable edge IDs between two nodes under the selected direction.

pub fn has_edge_between( &self, source: impl Into<NodeId>, target: impl Into<NodeId>, direction: TraversalDirection, ) -> Result<bool, GraphError>

Whether at least one edge connects an endpoint pair under the selected traversal direction.

impl Graph

pub fn new( kind: GraphKind, nodes: impl IntoIterator<Item = Node>, edges: impl IntoIterator<Item = Edge>, ) -> Result<Self, GraphError>

Validate and construct a graph.

pub fn with_attributes( kind: GraphKind, graph_attributes: Attributes, nodes: impl IntoIterator<Item = Node>, edges: impl IntoIterator<Item = Edge>, ) -> Result<Self, GraphError>

Validate and construct a graph with graph-level metadata.

pub fn kind(&self) -> GraphKind

Declared graph topology contract.

pub fn is_directed(&self) -> bool

Whether the graph is directed.

pub fn is_multigraph(&self) -> bool

Whether the graph declares support for parallel endpoint-pair edges.

pub fn attributes(&self) -> &Attributes

Graph-level immutable attributes.

pub fn node_count(&self) -> usize

Number of nodes.

pub fn edge_count(&self) -> usize

Number of stored edges. Undirected adjacency does not duplicate this public edge count.

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

Nodes in deterministic external-ID order.

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

Edges in deterministic stable-ID order.

pub fn node(&self, id: impl Into<NodeId>) -> Option<&Node>

Look up a node.

pub fn edge(&self, id: impl Into<EdgeId>) -> Option<&Edge>

Look up an edge.

pub fn contains_node(&self, id: impl Into<NodeId>) -> bool

Whether the graph contains a node.

pub fn contains_edge(&self, id: impl Into<EdgeId>) -> bool

Whether the graph contains an edge.

impl Graph

pub fn copy(&self) -> Self

Cheaply clone the immutable, reference-counted graph allocation.

pub fn to_directed(&self) -> Result<Self, GraphError>

Materialize directed traversal semantics without losing undirected edges or graph metadata.

pub fn to_undirected(&self) -> Result<Self, GraphError>

Return an immutable graph with undirected traversal semantics while preserving every original edge record and graph attribute.

pub fn induced_subgraph( &self, node_ids: impl IntoIterator<Item = impl Into<NodeId>>, ) -> Result<Self, GraphError>

Materialize an induced subgraph containing exactly the requested nodes and edges whose endpoints are both selected.

pub fn relabel( &self, mapping: &BTreeMap<NodeId, NodeId>, ) -> Result<Self, GraphError>

Return a graph with external node IDs replaced and every endpoint rewired. Distinct nodes may not merge implicitly.

pub fn compose(&self, right: &Self) -> Result<Self, GraphError>

Compose two immutable graphs. Right-hand attributes take precedence.

pub fn export_parts(&self) -> (Attributes, Vec<Node>, Vec<Edge>)

Create an owned export DTO with independently mutable attributes.

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 Deref for Graph

type Target = GraphInner

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl PartialEq for Graph

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Graph