https://github.com/vn-ki/gsgdt-rs

An opinionated graph visualization and graph diff visualization library
https://github.com/vn-ki/gsgdt-rs

diff graph

Last synced: 2 months ago
JSON representation

An opinionated graph visualization and graph diff visualization library

• Host: GitHub
• URL: https://github.com/vn-ki/gsgdt-rs
• Owner: vn-ki
• License: mit
• Created: 2020-10-26T08:26:27.000Z (about 4 years ago)
• Default Branch: master
• Last Pushed: 2020-11-11T13:35:23.000Z (about 4 years ago)
• Last Synced: 2024-10-31T15:37:33.293Z (2 months ago)
• Topics: diff, graph
• Language: Rust
• Homepage:
• Size: 85.9 KB
• Stars: 7
• Watchers: 2
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# gsgdt

**G**eneric **S**tringly typed **G**raph **D**ata**T**ype is an opinionated graph visualization and graph diff visualization library.

```rust

fn main() {

        let label1: String = "bb0__0_3".into();

        let label2: String = "bb0__1_3".into();

        let style: NodeStyle = Default::default();

        let nodes = vec![

            Node::from_list(

                vec!["_1 = const 1_i32".into(), "_2 = const 2_i32".into()],

                label1.clone(),

                "0".into(),

                style.clone(),

            ),

            Node::from_list(

                vec!["return".into()],

                label2.clone(),

                "1".into(),

                style.clone(),

            ),

        ];

        let g = Graph::new(

            "Mir_0_3".into(),

            nodes,

            vec![Edge::new(label1, label2, "return".into())],

        );

}

```

## Diffing two graphs

`gsgdt` offers functions which can be used find an approximate graph isomorphism

between two graphs. The algorithm matches using the content of the node (statements)

and the relative position of the node (the structure of the graph). This can then be rendered as a diff using graphviz.

![Diff](https://i.imgur.com/jLObxBs.png)

The green nodes and edges are newly added. The red nodes and edges are removed.

The code which produced the above image.

```rust

fn test_diff_readme() {

    let style: NodeStyle = Default::default();

    let g1 = Graph::new(

        "small".into(),

        vec![

            Node::from_list(

                vec!["_1 = const 1_i32".into(), "_2 = const 2_i32".into()],

                "bb0".into(),

                "bb0".into(),

                style.clone(),

            ),

            Node::from_list(

                vec!["return".into()],

                "bb1".into(),

                "bb1".into(),

                style.clone(),

            ),

        ],

        vec![Edge::new("bb0".into(), "bb1".into(), "return".into())],

    );

    let g2 = Graph::new(

        "small".into(),

        vec![

            Node::new(

                vec!["_1 = const 1_i32".into(), "_2 = const 2_i32".into()],

                "bb0".into(),

                "bb0".into(),

                style.clone(),

            ),

            Node::new(

                vec!["_2 = const 2_i32".into(), "_3 = const 3_i32".into()],

                "bb1".into(),

                "bb1".into(),

                style.clone(),

            ),

            Node::new(

                vec!["return".into()],

                "bb2".into(),

                "bb2".into(),

                style.clone(),

            ),

        ],

        vec![

            Edge::new("bb0".into(), "bb1".into(), "return".into()),

            Edge::new("bb1".into(), "bb2".into(), "return".into()),

        ],

    );

    let d1 = DiffGraph::new(&g1);

    let d2 = DiffGraph::new(&g2);

    let settings: GraphvizSettings = Default::default();

    let mg = visualize_diff(&d1, &d2);

    let mut f1 = std::fs::File::create("test1.dot").expect("create failed");

    mg.to_dot(&mut f1, &settings).unwrap();

}

```