scirs2-graph 0.4.1

Graph processing module for SciRS2 (scirs2-graph)
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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
//! JSON format I/O for graphs
//!
//! This module provides functionality for reading and writing graphs in JSON format.
//! The JSON format provides a flexible, human-readable representation of graph structures
//! with support for arbitrary node and edge attributes.
//!
//! # Format Specification
//!
//! The JSON graph format uses the following structure:
//! ```json
//! {
//!   "directed": false,
//!   "nodes": [
//!     {"id": "node1", "data": {...}},
//!     {"id": "node2", "data": {...}}
//!   ],
//!   "edges": [
//!     {"source": "node1", "target": "node2", "weight": 1.5},
//!     {"source": "node2", "target": "node3", "weight": 2.0}
//!   ]
//! }
//! ```
//!
//! # Examples
//!
//! ## Unweighted graph:
//! ```json
//! {
//!   "directed": false,
//!   "nodes": [
//!     {"id": "1"},
//!     {"id": "2"},
//!     {"id": "3"}
//!   ],
//!   "edges": [
//!     {"source": "1", "target": "2"},
//!     {"source": "2", "target": "3"}
//!   ]
//! }
//! ```
//!
//! ## Weighted graph:
//! ```json
//! {
//!   "directed": true,
//!   "nodes": [
//!     {"id": "1", "label": "Start"},
//!     {"id": "2", "label": "Middle"},
//!     {"id": "3", "label": "End"}
//!   ],
//!   "edges": [
//!     {"source": "1", "target": "2", "weight": 1.5},
//!     {"source": "2", "target": "3", "weight": 2.0}
//!   ]
//! }
//! ```
//!
//! # Usage
//!
//! ```rust
//! use std::fs::File;
//! use std::io::Write;
//! use tempfile::NamedTempFile;
//! use scirs2_graph::base::Graph;
//! use scirs2_graph::io::json::{read_json_format, write_json_format};
//!
//! // Create a temporary file with JSON data
//! let mut temp_file = NamedTempFile::new().expect("Operation failed");
//! writeln!(temp_file, r#"{{"directed": false, "nodes": [{{"id": "1"}}, {{"id": "2"}}], "edges": [{{"source": "1", "target": "2"}}]}}"#).expect("Operation failed");
//! temp_file.flush().expect("Operation failed");
//!
//! // Read the graph
//! let graph: Graph<i32, f64> = read_json_format(temp_file.path(), false).expect("Operation failed");
//! assert_eq!(graph.node_count(), 2);
//! assert_eq!(graph.edge_count(), 1);
//! ```

use std::collections::HashMap;
use std::fs::File;
use std::io::{BufReader, Write};
use std::path::Path;
use std::str::FromStr;

use serde::{Deserialize, Serialize};

use crate::base::{DiGraph, EdgeWeight, Graph, Node};
use crate::error::{GraphError, Result};

/// JSON representation of a graph node
#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct JsonNode {
    /// Node identifier
    pub id: String,
    /// Optional node label
    #[serde(skip_serializing_if = "Option::is_none")]
    pub label: Option<String>,
    /// Additional node data (currently unused but reserved for future extensions)
    #[serde(skip_serializing_if = "Option::is_none")]
    pub data: Option<serde_json::Value>,
}

/// JSON representation of a graph edge
#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct JsonEdge {
    /// Source node identifier
    pub source: String,
    /// Target node identifier
    pub target: String,
    /// Optional edge weight
    #[serde(skip_serializing_if = "Option::is_none")]
    pub weight: Option<f64>,
    /// Optional edge label
    #[serde(skip_serializing_if = "Option::is_none")]
    pub label: Option<String>,
    /// Additional edge data (currently unused but reserved for future extensions)
    #[serde(skip_serializing_if = "Option::is_none")]
    pub data: Option<serde_json::Value>,
}

/// JSON representation of a complete graph
#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct JsonGraph {
    /// Whether the graph is directed
    #[serde(default = "default_directed")]
    pub directed: bool,
    /// List of nodes in the graph
    pub nodes: Vec<JsonNode>,
    /// List of edges in the graph
    pub edges: Vec<JsonEdge>,
    /// Optional graph metadata
    #[serde(skip_serializing_if = "Option::is_none")]
    pub metadata: Option<serde_json::Value>,
}

/// Default value for directed field
#[allow(dead_code)]
fn default_directed() -> bool {
    false
}

/// Read an undirected graph from JSON format
///
/// # Arguments
///
/// * `path` - Path to the input file
/// * `weighted` - Whether to parse edge weights from the JSON
///
/// # Returns
///
/// * `Ok(Graph)` - The graph read from the file
/// * `Err(GraphError)` - If there was an error reading or parsing the file
///
/// # Format
///
/// The JSON format supports:
/// - Node declarations with optional labels and data
/// - Edge declarations with optional weights, labels, and data
/// - Graph metadata and directedness specification
/// - Flexible attribute storage for future extensions
#[allow(dead_code)]
pub fn read_json_format<N, E, P>(path: P, weighted: bool) -> Result<Graph<N, E>>
where
    N: Node + std::fmt::Debug + FromStr + Clone,
    E: EdgeWeight + std::marker::Copy + std::fmt::Debug + std::default::Default + FromStr,
    P: AsRef<Path>,
{
    let file = File::open(path)?;
    let reader = BufReader::new(file);
    let json_graph: JsonGraph = serde_json::from_reader(reader)
        .map_err(|e| GraphError::Other(format!("Failed to parse JSON: {e}")))?;

    // Verify this is an undirected graph
    if json_graph.directed {
        return Err(GraphError::Other(
            "JSON file contains a directed graph, but undirected graph was requested".to_string(),
        ));
    }

    let mut graph = Graph::new();

    // Parse nodes first to ensure they exist
    let mut node_map = HashMap::new();
    for json_node in &json_graph.nodes {
        let node = N::from_str(&json_node.id)
            .map_err(|_| GraphError::Other(format!("Failed to parse node ID: {}", json_node.id)))?;
        node_map.insert(json_node.id.clone(), node);
    }

    // Parse edges
    for json_edge in &json_graph.edges {
        let source_node = node_map.get(&json_edge.source).ok_or_else(|| {
            GraphError::Other(format!(
                "Edge references unknown source node: {}",
                json_edge.source
            ))
        })?;

        let target_node = node_map.get(&json_edge.target).ok_or_else(|| {
            GraphError::Other(format!(
                "Edge references unknown target node: {}",
                json_edge.target
            ))
        })?;

        // Parse weight if needed
        let weight = if weighted {
            if let Some(w) = json_edge.weight {
                E::from_str(&w.to_string())
                    .map_err(|_| GraphError::Other(format!("Failed to parse edge weight: {w}")))?
            } else {
                E::default()
            }
        } else {
            E::default()
        };

        // Add edge
        graph.add_edge(source_node.clone(), target_node.clone(), weight)?;
    }

    Ok(graph)
}

/// Read a directed graph from JSON format
///
/// # Arguments
///
/// * `path` - Path to the input file
/// * `weighted` - Whether to parse edge weights from the JSON
///
/// # Returns
///
/// * `Ok(DiGraph)` - The directed graph read from the file
/// * `Err(GraphError)` - If there was an error reading or parsing the file
#[allow(dead_code)]
pub fn read_json_format_digraph<N, E, P>(path: P, weighted: bool) -> Result<DiGraph<N, E>>
where
    N: Node + std::fmt::Debug + FromStr + Clone,
    E: EdgeWeight + std::marker::Copy + std::fmt::Debug + std::default::Default + FromStr,
    P: AsRef<Path>,
{
    let file = File::open(path)?;
    let reader = BufReader::new(file);
    let json_graph: JsonGraph = serde_json::from_reader(reader)
        .map_err(|e| GraphError::Other(format!("Failed to parse JSON: {e}")))?;

    let mut graph = DiGraph::new();

    // Parse nodes first to ensure they exist
    let mut node_map = HashMap::new();
    for json_node in &json_graph.nodes {
        let node = N::from_str(&json_node.id)
            .map_err(|_| GraphError::Other(format!("Failed to parse node ID: {}", json_node.id)))?;
        node_map.insert(json_node.id.clone(), node);
    }

    // Parse edges
    for json_edge in &json_graph.edges {
        let source_node = node_map.get(&json_edge.source).ok_or_else(|| {
            GraphError::Other(format!(
                "Edge references unknown source node: {}",
                json_edge.source
            ))
        })?;

        let target_node = node_map.get(&json_edge.target).ok_or_else(|| {
            GraphError::Other(format!(
                "Edge references unknown target node: {}",
                json_edge.target
            ))
        })?;

        // Parse weight if needed
        let weight = if weighted {
            if let Some(w) = json_edge.weight {
                E::from_str(&w.to_string())
                    .map_err(|_| GraphError::Other(format!("Failed to parse edge weight: {w}")))?
            } else {
                E::default()
            }
        } else {
            E::default()
        };

        // Add directed edge
        graph.add_edge(source_node.clone(), target_node.clone(), weight)?;
    }

    Ok(graph)
}

/// Write an undirected graph to JSON format
///
/// # Arguments
///
/// * `graph` - The graph to write
/// * `path` - Path to the output file
/// * `weighted` - Whether to include edge weights in the output
///
/// # Returns
///
/// * `Ok(())` - If the graph was written successfully
/// * `Err(GraphError)` - If there was an error writing the file
#[allow(dead_code)]
pub fn write_json_format<N, E, Ix, P>(
    graph: &Graph<N, E, Ix>,
    path: P,
    weighted: bool,
) -> Result<()>
where
    N: Node + std::fmt::Debug + std::fmt::Display + Clone,
    E: EdgeWeight
        + std::marker::Copy
        + std::fmt::Debug
        + std::default::Default
        + std::fmt::Display
        + Clone,
    Ix: petgraph::graph::IndexType,
    P: AsRef<Path>,
{
    let mut file = File::create(path)?;

    // Collect nodes
    let nodes: Vec<JsonNode> = graph
        .nodes()
        .iter()
        .map(|node| JsonNode {
            id: node.to_string(),
            label: None,
            data: None,
        })
        .collect();

    // Collect edges
    let edges: Vec<JsonEdge> = graph
        .edges()
        .iter()
        .map(|edge| JsonEdge {
            source: edge.source.to_string(),
            target: edge.target.to_string(),
            weight: if weighted {
                // Convert weight to f64 through string parsing
                edge.weight.to_string().parse::<f64>().ok()
            } else {
                None
            },
            label: None,
            data: None,
        })
        .collect();

    // Create JSON graph
    let json_graph = JsonGraph {
        directed: false,
        nodes,
        edges,
        metadata: None,
    };

    // Write JSON to file
    let json_string = serde_json::to_string_pretty(&json_graph)
        .map_err(|e| GraphError::Other(format!("Failed to serialize JSON: {e}")))?;

    write!(file, "{json_string}")?;

    Ok(())
}

/// Write a directed graph to JSON format
///
/// # Arguments
///
/// * `graph` - The directed graph to write
/// * `path` - Path to the output file
/// * `weighted` - Whether to include edge weights in the output
///
/// # Returns
///
/// * `Ok(())` - If the graph was written successfully
/// * `Err(GraphError)` - If there was an error writing the file
#[allow(dead_code)]
pub fn write_json_format_digraph<N, E, Ix, P>(
    graph: &DiGraph<N, E, Ix>,
    path: P,
    weighted: bool,
) -> Result<()>
where
    N: Node + std::fmt::Debug + std::fmt::Display + Clone,
    E: EdgeWeight
        + std::marker::Copy
        + std::fmt::Debug
        + std::default::Default
        + std::fmt::Display
        + Clone,
    Ix: petgraph::graph::IndexType,
    P: AsRef<Path>,
{
    let mut file = File::create(path)?;

    // Collect nodes
    let nodes: Vec<JsonNode> = graph
        .nodes()
        .iter()
        .map(|node| JsonNode {
            id: node.to_string(),
            label: None,
            data: None,
        })
        .collect();

    // Collect edges
    let edges: Vec<JsonEdge> = graph
        .edges()
        .iter()
        .map(|edge| JsonEdge {
            source: edge.source.to_string(),
            target: edge.target.to_string(),
            weight: if weighted {
                // Convert weight to f64 through string parsing
                edge.weight.to_string().parse::<f64>().ok()
            } else {
                None
            },
            label: None,
            data: None,
        })
        .collect();

    // Create JSON graph
    let json_graph = JsonGraph {
        directed: true,
        nodes,
        edges,
        metadata: None,
    };

    // Write JSON to file
    let json_string = serde_json::to_string_pretty(&json_graph)
        .map_err(|e| GraphError::Other(format!("Failed to serialize JSON: {e}")))?;

    write!(file, "{json_string}")?;

    Ok(())
}

#[cfg(test)]
mod tests {
    use super::*;
    use std::io::Write;
    use tempfile::NamedTempFile;

    #[test]
    fn test_read_json_undirected() {
        let mut temp_file = NamedTempFile::new().expect("Operation failed");
        writeln!(
            temp_file,
            r#"{{
                "directed": false,
                "nodes": [
                    {{"id": "1"}},
                    {{"id": "2"}},
                    {{"id": "3"}}
                ],
                "edges": [
                    {{"source": "1", "target": "2"}},
                    {{"source": "2", "target": "3"}}
                ]
            }}"#
        )
        .expect("Test: operation failed");
        temp_file.flush().expect("Operation failed");

        let graph: Graph<i32, f64> =
            read_json_format(temp_file.path(), false).expect("Operation failed");

        assert_eq!(graph.node_count(), 3);
        assert_eq!(graph.edge_count(), 2);
    }

    #[test]
    fn test_read_json_directed() {
        let mut temp_file = NamedTempFile::new().expect("Operation failed");
        writeln!(
            temp_file,
            r#"{{
                "directed": true,
                "nodes": [
                    {{"id": "1"}},
                    {{"id": "2"}},
                    {{"id": "3"}}
                ],
                "edges": [
                    {{"source": "1", "target": "2"}},
                    {{"source": "2", "target": "3"}}
                ]
            }}"#
        )
        .expect("Test: operation failed");
        temp_file.flush().expect("Operation failed");

        let graph: DiGraph<i32, f64> =
            read_json_format_digraph(temp_file.path(), false).expect("Operation failed");

        assert_eq!(graph.node_count(), 3);
        assert_eq!(graph.edge_count(), 2);
    }

    #[test]
    fn test_read_json_weighted() {
        let mut temp_file = NamedTempFile::new().expect("Operation failed");
        writeln!(
            temp_file,
            r#"{{
                "directed": false,
                "nodes": [
                    {{"id": "1"}},
                    {{"id": "2"}},
                    {{"id": "3"}}
                ],
                "edges": [
                    {{"source": "1", "target": "2", "weight": 1.5}},
                    {{"source": "2", "target": "3", "weight": 2.0}}
                ]
            }}"#
        )
        .expect("Test: operation failed");
        temp_file.flush().expect("Operation failed");

        let graph: Graph<i32, f64> =
            read_json_format(temp_file.path(), true).expect("Operation failed");

        assert_eq!(graph.node_count(), 3);
        assert_eq!(graph.edge_count(), 2);
    }

    #[test]
    fn test_write_read_roundtrip() {
        let mut original_graph: Graph<i32, f64> = Graph::new();
        original_graph
            .add_edge(1i32, 2i32, 1.5f64)
            .expect("Operation failed");
        original_graph
            .add_edge(2i32, 3i32, 2.0f64)
            .expect("Operation failed");

        let temp_file = NamedTempFile::new().expect("Operation failed");
        write_json_format(&original_graph, temp_file.path(), true).expect("Operation failed");

        let read_graph: Graph<i32, f64> =
            read_json_format(temp_file.path(), true).expect("Operation failed");

        assert_eq!(read_graph.node_count(), original_graph.node_count());
        assert_eq!(read_graph.edge_count(), original_graph.edge_count());
    }

    #[test]
    fn test_digraph_write_read_roundtrip() {
        let mut original_graph: DiGraph<i32, f64> = DiGraph::new();
        original_graph
            .add_edge(1i32, 2i32, 1.5f64)
            .expect("Operation failed");
        original_graph
            .add_edge(2i32, 3i32, 2.0f64)
            .expect("Operation failed");

        let temp_file = NamedTempFile::new().expect("Operation failed");
        write_json_format_digraph(&original_graph, temp_file.path(), true)
            .expect("Operation failed");

        let read_graph: DiGraph<i32, f64> =
            read_json_format_digraph(temp_file.path(), true).expect("Operation failed");

        assert_eq!(read_graph.node_count(), original_graph.node_count());
        assert_eq!(read_graph.edge_count(), original_graph.edge_count());
    }

    #[test]
    fn test_invalid_json() {
        let mut temp_file = NamedTempFile::new().expect("Operation failed");
        writeln!(temp_file, "{{invalid json").expect("Operation failed");
        temp_file.flush().expect("Operation failed");

        let result: Result<Graph<i32, f64>> = read_json_format(temp_file.path(), false);
        assert!(result.is_err());
    }

    #[test]
    fn test_missing_node_reference() {
        let mut temp_file = NamedTempFile::new().expect("Operation failed");
        writeln!(
            temp_file,
            r#"{{
                "directed": false,
                "nodes": [
                    {{"id": "1"}},
                    {{"id": "2"}}
                ],
                "edges": [
                    {{"source": "1", "target": "3"}}
                ]
            }}"#
        )
        .expect("Test: operation failed");
        temp_file.flush().expect("Operation failed");

        let result: Result<Graph<i32, f64>> = read_json_format(temp_file.path(), false);
        assert!(result.is_err());
    }

    #[test]
    fn test_directed_graph_mismatch() {
        let mut temp_file = NamedTempFile::new().expect("Operation failed");
        writeln!(
            temp_file,
            r#"{{
                "directed": true,
                "nodes": [
                    {{"id": "1"}},
                    {{"id": "2"}}
                ],
                "edges": [
                    {{"source": "1", "target": "2"}}
                ]
            }}"#
        )
        .expect("Test: operation failed");
        temp_file.flush().expect("Operation failed");

        // Try to read as undirected graph - should fail
        let result: Result<Graph<i32, f64>> = read_json_format(temp_file.path(), false);
        assert!(result.is_err());
    }
}