Struct SerializableGraph 

pub struct SerializableGraph {
    pub nodes: HashMap<usize, String>,
    pub edges: Vec<(usize, usize, Option<String>)>,
    pub directed: bool,
    pub name: Option<String>,
}

A simple graph representation for serialization purposes.

Fields

nodes: HashMap<usize, String>

Nodes: id -> optional label.

edges: Vec<(usize, usize, Option<String>)>

Edges: (from, to) -> optional label.

directed: bool

Whether the graph is directed.

name: Option<String>

Optional graph name.

Implementations

impl SerializableGraph

pub fn new_directed() -> Self

Create a new empty directed graph.

pub fn new_undirected() -> Self

Create a new empty undirected graph.

pub fn add_node(&mut self, id: usize, label: impl Into<String>)

Add a node with an optional label.

pub fn add_edge(&mut self, from: usize, to: usize, label: Option<String>)

Add an edge between two nodes with an optional label.

pub fn to_dot(&self) -> String

Serialize to DOT (Graphviz) format.

pub fn to_adjacency_list(&self) -> String

Serialize to adjacency list format. Each line: <node_id>: <neighbor1> <neighbor2> ...

pub fn to_edge_list(&self) -> String

Serialize to edge list format. Each line: <from> <to> or <from> <to> <label>.

pub fn node_count(&self) -> usize

Returns the number of nodes.

pub fn edge_count(&self) -> usize

Returns the number of edges.

Trait Implementations

impl Clone for SerializableGraph

fn clone(&self) -> SerializableGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SerializableGraph

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

Formats the value using the given formatter.