Struct Graph

pub struct Graph { /* private fields */ }

The extracted dependency graph.

Edges are ordered by normalized (source, target). Parallel edges are merged and their import kinds are unioned, so every endpoint pair occurs at most once.

Implementations

impl Graph

pub const fn new() -> Self

Creates an empty graph.

pub fn from_edges(edges: impl IntoIterator<Item = Edge>) -> Self

Creates a deterministic graph and merges parallel endpoint pairs.

If inconsistent callers describe one endpoint pair as both internal and external, the internal classification wins. Same-source pairs become canonical marker self-edges.

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

Returns all merged edges in deterministic endpoint order.

pub fn len(&self) -> usize

Returns the number of edges.

pub fn is_empty(&self) -> bool

Returns whether the graph has no edges.

pub fn iter(&self) -> Iter<'_, Edge>

Iterates over graph edges without exposing mutable access.

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a copy 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 Default for Graph

fn default() -> Graph

Returns the “default value” for a type.

impl Display for Graph

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

Formats the value using the given formatter.

impl FromIterator<Edge> for Graph

fn from_iter<T: IntoIterator<Item = Edge>>(edges: T) -> Self

Creates a value from an iterator.

impl<'a> IntoIterator for &'a Graph

type Item = &'a Edge

The type of the elements being iterated over.

type IntoIter = Iter<'a, Edge>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl IntoIterator for Graph

type Item = Edge

The type of the elements being iterated over.

type IntoIter = IntoIter<Edge>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for Graph

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Graph

impl StructuralPartialEq for Graph