Struct hugr_core::hugr::views::petgraph::PetgraphWrapper

pub struct PetgraphWrapper<'a, T> { /* private fields */ }

Wrapper for a HugrView that implements petgraph’s traits.

It can be used to apply petgraph’s algorithms to a Hugr.

Trait Implementations

impl<'a, T> Clone for PetgraphWrapper<'a, T>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a, T> Data for PetgraphWrapper<'a, T>

where T: HugrView,

type NodeWeight = OpType

type EdgeWeight = EdgeKind

impl<'a, T: Debug> Debug for PetgraphWrapper<'a, T>

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

Formats the value using the given formatter.

impl<'a, T> EdgeCount for PetgraphWrapper<'a, T>

where T: HugrView,

fn edge_count(&self) -> usize

Return the number of edges in the graph.

impl<'a, T> From<&'a T> for PetgraphWrapper<'a, T>

where T: HugrView,

fn from(hugr: &'a T) -> Self

Converts to this type from the input type.

impl<'a, T> GetAdjacencyMatrix for PetgraphWrapper<'a, T>

where T: HugrView,

type AdjMatrix = HashSet<(<PetgraphWrapper<'a, T> as GraphBase>::NodeId, <PetgraphWrapper<'a, T> as GraphBase>::NodeId)>

The associated adjacency matrix type

fn adjacency_matrix(&self) -> Self::AdjMatrix

Create the adjacency matrix

fn is_adjacent( &self, matrix: &Self::AdjMatrix, a: Self::NodeId, b: Self::NodeId, ) -> bool

Return true if there is an edge from a to b, false otherwise.

impl<'a, T> GraphBase for PetgraphWrapper<'a, T>

where T: HugrView,

type NodeId = Node

node identifier

type EdgeId = ((Node, Port), (Node, Port))

edge identifier

impl<'a, T> GraphProp for PetgraphWrapper<'a, T>

where T: HugrView,

type EdgeType = Directed

The kind of edges in the graph.

fn is_directed(&self) -> bool

impl<'a, T> IntoNeighbors for PetgraphWrapper<'a, T>

where T: HugrView,

type Neighbors = <T as HugrView>::Neighbours<'a>

fn neighbors(self, n: Self::NodeId) -> Self::Neighbors

Return an iterator of the neighbors of node a.

impl<'a, T> IntoNeighborsDirected for PetgraphWrapper<'a, T>

where T: HugrView,

type NeighborsDirected = <T as HugrView>::Neighbours<'a>

fn neighbors_directed( self, n: Self::NodeId, d: Direction, ) -> Self::NeighborsDirected

impl<'a, T> IntoNodeIdentifiers for PetgraphWrapper<'a, T>

where T: HugrView,

type NodeIdentifiers = <T as HugrView>::Nodes<'a>

fn node_identifiers(self) -> Self::NodeIdentifiers

impl<'a, T> IntoNodeReferences for PetgraphWrapper<'a, T>

where T: HugrView,

type NodeRef = HugrNodeRef<'a>

type NodeReferences = MapCtx<WithCtx<<T as HugrView>::Nodes<'a>, PetgraphWrapper<'a, T>>, HugrNodeRef<'a>>

fn node_references(self) -> Self::NodeReferences

impl<'a, T> NodeCount for PetgraphWrapper<'a, T>

where T: HugrView,

fn node_count(&self) -> usize

impl<'a, T> NodeIndexable for PetgraphWrapper<'a, T>

where T: HugrView,

fn node_bound(&self) -> usize

Return an upper bound of the node indices in the graph (suitable for the size of a bitmap).

fn to_index(&self, ix: Self::NodeId) -> usize

Convert a to an integer index.

fn from_index(&self, ix: usize) -> Self::NodeId

Convert i to a node index. i must be a valid value in the graph.

impl<'a, T> Visitable for PetgraphWrapper<'a, T>

where T: HugrView,

type Map = HashSet<<PetgraphWrapper<'a, T> as GraphBase>::NodeId>

The associated map type

fn visit_map(&self) -> Self::Map

Create a new visitor map

fn reset_map(&self, map: &mut Self::Map)

Reset the visitor map (and resize to new size of graph if needed)

impl<'a, T> Copy for PetgraphWrapper<'a, T>

impl<'a, T> GraphRef for PetgraphWrapper<'a, T>

where T: HugrView,