Struct OwningGraph 

pub struct OwningGraph<NodeId: Identifier, EdgeId: Identifier, NodeData, EdgeData> { /* private fields */ }

An example Graph implementation with usize identifiers and simple payloads, used in tests.

Implementations

impl<NodeId: Identifier, EdgeId: Identifier, NodeData, EdgeData> OwningGraph<NodeId, EdgeId, NodeData, EdgeData>

pub fn make_node(&mut self, data: NodeData) -> NodeId

Creates a new node Creates a new node with payload data and returns its identifier.

pub fn make_edge(&mut self, from: NodeId, to: NodeId, data: EdgeData) -> EdgeId

Creates a new edge from from to to with payload data.

Panics

Panics if either endpoint does not exist.

pub fn remove_edge(&mut self, id: EdgeId)

Removes an edge by identifier.

Panics

Panics if the edge does not exist.

pub fn edit_edge(&mut self, id: EdgeId, new_from: NodeId, new_to: NodeId)

Edits an edge’s endpoints

pub fn remove_node(&mut self, id: NodeId)

Removes a node and all of its incident edges.

Panics

Panics if the node does not exist.

pub fn reinterpret<NewNodeData, NewEdgeData, Fn, Fe>( &self, node_data_map: Fn, edge_data_map: Fe, ) -> OwningGraph<NodeId, EdgeId, NewNodeData, NewEdgeData>

where Fn: FnMut(&NodeData) -> NewNodeData, Fe: FnMut(&EdgeData) -> NewEdgeData,

Returns an iterator over the immediate successor blocks — blocks that this block may transfer control to.

impl<'src, NodeId: Identifier, EdgeId: Identifier> OwningGraph<NodeId, EdgeId, &'src str, &'src str>

pub fn parse(source: &'src str) -> Result<Self, ParseError<'src>>

pub fn get_node_by_name(&self, name: &str) -> Option<NodeId>

pub fn get_edge_by_data(&self, data: &str) -> Option<EdgeId>

Trait Implementations

impl<NodeId: Identifier, EdgeId: Identifier, NodeData, EdgeData> Default for OwningGraph<NodeId, EdgeId, NodeData, EdgeData>

fn default() -> Self

Returns the “default value” for a type.

impl<NodeId: Identifier, EdgeId: Identifier, NodeData, EdgeData> Graph for OwningGraph<NodeId, EdgeId, NodeData, EdgeData>

type NodeId = NodeId

type EdgeId = EdgeId

type Hasher = RandomState

Hasher backing the graph’s incident-edge sets and DFS bookkeeping.

type Node<'a> = NodeRef<'a, NodeId, EdgeId, NodeData, EdgeData> where Self: 'a

type Edge<'a> = EdgeRef<'a, NodeId, EdgeId, NodeData, EdgeData> where Self: 'a

fn get_node(&self, id: Self::NodeId) -> Option<Self::Node<'_>>

Gets a node in the graph by its identifier, if it exists.

fn get_edge(&self, id: Self::EdgeId) -> Option<Self::Edge<'_>>

fn nodes(&self) -> impl Iterator<Item = Self::Node<'_>> + '_

Iterates over all nodes in insertion identifier order.

fn edges(&self) -> impl Iterator<Item = Self::Edge<'_>> + '_

Iterates over all edges in insertion identifier order.

fn dfs(&self, root: Self::NodeId) -> DfsIter<'_, Directed, Self>

where Self: Sized,

A dfs iterator over the graph starting from the root, if present.

fn undirected_dfs(&self, root: Self::NodeId) -> DfsIter<'_, Undirected, Self>

where Self: Sized,

A dfs iterator over the graph treating edges as undirected.

impl<NodeId: Identifier, EdgeId: Identifier, NodeData, EdgeData> GraphMut for OwningGraph<NodeId, EdgeId, NodeData, EdgeData>

type NodeMut<'a> = NodeMutRef<'a, NodeId, EdgeId, NodeData, EdgeData> where Self: 'a

type EdgeMut<'a> = EdgeMutRef<'a, NodeId, EdgeId, NodeData, EdgeData> where Self: 'a

fn get_node_mut(&mut self, id: Self::NodeId) -> Option<Self::NodeMut<'_>>

fn get_edge_mut(&mut self, id: Self::EdgeId) -> Option<Self::EdgeMut<'_>>

fn merge_nodes( &mut self, keep: Self::NodeId, remove: Self::NodeId, direct_edge: Self::EdgeId, )

where Self: Sized,

Merges remove into keep at the graph-structural level.