graph_generation_language 0.0.4

Core library for the Graph Generation Language (GGL)
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139

//! Core data structures for representing graphs.

use serde::{Deserialize, Serialize};
use serde_json::Value;
use std::collections::HashMap;

#[derive(Serialize, Deserialize, Debug, Clone)]
pub struct Graph {
    pub nodes: HashMap<String, Node>,
    pub edges: HashMap<String, Edge>,
}

#[derive(Serialize, Deserialize, Debug, Clone)]
pub struct Node {
    pub r#type: String,
    pub metadata: HashMap<String, Value>,
}

#[derive(Serialize, Deserialize, Debug, Clone)]
pub struct Edge {
    pub source: String,
    pub target: String,
    pub directed: bool,
    pub metadata: HashMap<String, Value>,
}

impl Graph {
    pub fn new() -> Self {
        Graph {
            nodes: HashMap::new(),
            edges: HashMap::new(),
        }
    }

    pub fn add_node(&mut self, id: String, node: Node) {
        self.nodes.insert(id, node);
    }

    pub fn add_edge(&mut self, id: String, edge: Edge) {
        self.edges.insert(id, edge);
    }

    pub fn get_node(&self, id: &str) -> Option<&Node> {
        self.nodes.get(id)
    }

    pub fn get_node_mut(&mut self, id: &str) -> Option<&mut Node> {
        self.nodes.get_mut(id)
    }

    pub fn remove_node(&mut self, id: &str) -> Option<Node> {
        self.nodes.remove(id)
    }

    pub fn to_json(&self) -> Result<String, serde_json::Error> {
        serde_json::to_string_pretty(self)
    }

    /// Generates a unique node ID based on a prefix.
    pub fn generate_unique_node_id(&self, prefix: &str) -> String {
        let mut i = 0;
        loop {
            let id = format!("{prefix}_{i}");
            if !self.nodes.contains_key(&id) {
                return id;
            }
            i += 1;
        }
    }

    /// Generates a unique edge ID based on a prefix.
    pub fn generate_unique_edge_id(&self, prefix: &str) -> String {
        let mut i = 0;
        loop {
            let id = format!("{prefix}_{i}");
            if !self.edges.contains_key(&id) {
                return id;
            }
            i += 1;
        }
    }
}

impl Default for Node {
    fn default() -> Self {
        Self::new()
    }
}

impl Node {
    pub fn new() -> Self {
        Node {
            r#type: "default".to_string(),
            metadata: HashMap::new(),
        }
    }

    pub fn with_type(mut self, node_type: String) -> Self {
        self.r#type = node_type;
        self
    }

    pub fn with_metadata(mut self, key: String, value: Value) -> Self {
        self.metadata.insert(key, value);
        self
    }

    pub fn with_metadata_map(mut self, metadata_map: HashMap<String, Value>) -> Self {
        self.metadata.extend(metadata_map);
        self
    }
}

impl Edge {
    pub fn new(source: String, target: String, directed: bool) -> Self {
        Edge {
            source,
            target,
            directed,
            metadata: HashMap::new(),
        }
    }

    pub fn with_metadata(mut self, key: String, value: Value) -> Self {
        self.metadata.insert(key, value);
        self
    }

    pub fn with_metadata_map(mut self, metadata_map: HashMap<String, Value>) -> Self {
        self.metadata.extend(metadata_map);
        self
    }
}

impl Default for Graph {
    fn default() -> Self {
        Self::new()
    }
}