Struct TopologyGraph 

pub struct TopologyGraph {
    pub nodes: HashMap<String, Node>,
    pub edges: Vec<Edge>,
    pub topological_order: Vec<String>,
    pub reverse_topological_order: Vec<String>,
}

Complete topology graph representation

Fields

nodes: HashMap<String, Node>

All nodes in the topology

edges: Vec<Edge>

All edges in the topology

topological_order: Vec<String>

Topologically sorted order of nodes

reverse_topological_order: Vec<String>

Reverse topological order (dependencies first)

Implementations

impl TopologyGraph

pub fn new() -> Self

Create a new empty topology graph

pub fn add_node(&mut self, node: Node)

Add a node to the topology

pub fn add_edge(&mut self, edge: Edge)

Add an edge to the topology

pub fn node_count(&self) -> usize

Get the number of nodes

pub fn edge_count(&self) -> usize

Get the number of edges

Trait Implementations

impl Clone for TopologyGraph

fn clone(&self) -> TopologyGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TopologyGraph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for TopologyGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for TopologyGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.