Struct Graph

pub struct Graph {
    pub name: String,
    pub nodes: Vec<Node>,
    pub edges: Vec<Edge>,
}

Graph represents a directed graph as a list of nodes and list of edges.

Fields

name: String

Identifier for the graph

nodes: Vec<Node>

The Vector containing the Nodes

edges: Vec<Edge>

The Vector containing the Edges

Implementations

impl Graph

pub fn new(name: String, nodes: Vec<Node>, edges: Vec<Edge>) -> Graph

pub fn adj_list(&self) -> AdjList<'_>

Returns the adjacency list representation of the graph. Adjacency list can be used to easily find the childern of a given node. If the a node does not have any childern, then the list correspoding to that node will be empty.

pub fn rev_adj_list(&self) -> AdjList<'_>

Returns the reverse adjacency list representation of the graph. Reverse adjacency list represents the adjacency list of a directed graph where the edges have been reversed. Reverse adjacency list can be used to easily find the parents of a given node. If the a node does not have any childern, then the list correspoding to that node will be empty.

pub fn get_node_by_label(&self, label: &str) -> Option<&Node>

Returns the node with the given label, if found.

pub fn to_dot<W: Write>( &self, w: &mut W, settings: &GraphvizSettings, as_subgraph: bool, ) -> Result<()>

Returns the dot representation of the given graph. This can rendered using the graphviz program.

Trait Implementations

impl<'de> Deserialize<'de> for Graph

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for Graph

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

where __S: Serializer,

Serialize this value into the given Serde serializer.