oak-visualize 0.0.11

High-performance visualization and layout algorithms for the oak ecosystem with flexible configuration, emphasizing tree and graph visualization.
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

use oak_visualize::{
    geometry::Size,
    tree::{TreeLayout, TreeLayoutAlgorithm, TreeLayoutConfig, TreeNode, TreeRenderConfig, TreeRenderer},
};

#[test]
fn test_tree_node_creation() {
    let node = TreeNode::new("root".to_string(), "Root Node".to_string(), "root".to_string());

    assert_eq!(node.id, "root");
    assert_eq!(node.label, "Root Node");
    assert_eq!(node.node_type, "root");
    assert!(node.children.is_empty());
    assert!(node.attributes.is_empty());
    assert!(node.size.is_none());
    assert!(node.is_leaf());
}

#[test]
fn test_tree_node_with_children() {
    let node = TreeNode::new("root".to_string(), "Root Node".to_string(), "root".to_string()).with_child(TreeNode::new("child1".to_string(), "Child 1".to_string(), "child".to_string())).with_child(TreeNode::new(
        "child2".to_string(),
        "Child 2".to_string(),
        "child".to_string(),
    ));

    assert_eq!(node.children.len(), 2);
    assert_eq!(node.depth(), 2);
    assert_eq!(node.node_count(), 3);
    assert_eq!(node.leaf_count(), 2);
    assert!(!node.is_leaf());
}

#[test]
fn test_tree_node_with_multiple_children() {
    let children =
        vec![TreeNode::new("child1".to_string(), "Child 1".to_string(), "child".to_string()), TreeNode::new("child2".to_string(), "Child 2".to_string(), "child".to_string()), TreeNode::new("child3".to_string(), "Child 3".to_string(), "child".to_string())];

    let node = TreeNode::new("root".to_string(), "Root".to_string(), "root".to_string()).with_children(children);

    assert_eq!(node.children.len(), 3);
    assert_eq!(node.leaf_count(), 3);
}

#[test]
fn test_tree_node_attributes() {
    let node = TreeNode::new("test".to_string(), "Test".to_string(), "test".to_string()).with_attribute("key1".to_string(), "value1".to_string()).with_attribute("key2".to_string(), "value2".to_string());

    assert_eq!(node.attributes.len(), 2);
    assert_eq!(node.attributes.get("key1"), Some(&"value1".to_string()));
    assert_eq!(node.attributes.get("key2"), Some(&"value2".to_string()));
}

#[test]
fn test_tree_node_with_size() {
    let size = Size::new(100.0, 50.0);
    let node = TreeNode::new("test".to_string(), "Test".to_string(), "test".to_string()).with_size(size);

    assert_eq!(node.size, Some(size));
}

#[test]
fn test_tree_depth_calculation() {
    let deep_tree = TreeNode::new("root".to_string(), "Root".to_string(), "root".to_string()).with_child(
        TreeNode::new("level1".to_string(), "Level 1".to_string(), "node".to_string()).with_child(TreeNode::new("level2".to_string(), "Level 2".to_string(), "node".to_string()).with_child(TreeNode::new(
            "level3".to_string(),
            "Level 3".to_string(),
            "leaf".to_string(),
        ))),
    );

    assert_eq!(deep_tree.depth(), 4);
    assert_eq!(deep_tree.node_count(), 4);
    assert_eq!(deep_tree.leaf_count(), 1);
    assert!(!deep_tree.is_leaf());
}

#[test]
fn test_layered_tree_layout() {
    let tree = TreeNode::new("root".to_string(), "Root".to_string(), "root".to_string()).with_child(TreeNode::new("child1".to_string(), "Child 1".to_string(), "child".to_string())).with_child(TreeNode::new(
        "child2".to_string(),
        "Child 2".to_string(),
        "child".to_string(),
    ));

    let layout_engine = TreeLayout::new().with_algorithm(TreeLayoutAlgorithm::Layered);
    let result = layout_engine.layout_tree(&tree);

    assert!(result.is_ok());
    let layout = result.unwrap();
    assert_eq!(layout.nodes.len(), 3);
    assert_eq!(layout.edges.len(), 2);

    // Check that all nodes are positioned
    assert!(layout.nodes.contains_key("root"));
    assert!(layout.nodes.contains_key("child1"));
    assert!(layout.nodes.contains_key("child2"));
}

#[test]
fn test_radial_tree_layout() {
    let tree = TreeNode::new("root".to_string(), "Root".to_string(), "root".to_string()).with_children(vec![
        TreeNode::new("child1".to_string(), "Child 1".to_string(), "child".to_string()),
        TreeNode::new("child2".to_string(), "Child 2".to_string(), "child".to_string()),
        TreeNode::new("child3".to_string(), "Child 3".to_string(), "child".to_string()),
    ]);

    let layout_engine = TreeLayout::new().with_algorithm(TreeLayoutAlgorithm::Radial);
    let result = layout_engine.layout_tree(&tree);

    assert!(result.is_ok());
    let layout = result.unwrap();
    assert_eq!(layout.nodes.len(), 4);
    assert_eq!(layout.edges.len(), 3);
}

#[test]
fn test_compact_tree_layout() {
    let tree = TreeNode::new("root".to_string(), "Root".to_string(), "root".to_string())
        .with_children(vec![TreeNode::new("child1".to_string(), "Child 1".to_string(), "child".to_string()), TreeNode::new("child2".to_string(), "Child 2".to_string(), "child".to_string())]);

    let layout_engine = TreeLayout::new().with_algorithm(TreeLayoutAlgorithm::Compact);
    let result = layout_engine.layout_tree(&tree);

    assert!(result.is_ok());
    let layout = result.unwrap();
    assert_eq!(layout.nodes.len(), 3);
    assert_eq!(layout.edges.len(), 2);
}

#[test]
fn test_balloon_tree_layout() {
    let tree = TreeNode::new("root".to_string(), "Root".to_string(), "root".to_string())
        .with_children(vec![TreeNode::new("child1".to_string(), "Child 1".to_string(), "child".to_string()), TreeNode::new("child2".to_string(), "Child 2".to_string(), "child".to_string())]);

    let layout_engine = TreeLayout::new().with_algorithm(TreeLayoutAlgorithm::Balloon);
    let result = layout_engine.layout_tree(&tree);

    assert!(result.is_ok());
    let layout = result.unwrap();
    assert_eq!(layout.nodes.len(), 3);
    assert_eq!(layout.edges.len(), 2);
}

#[test]
fn test_tree_layout_with_custom_config() {
    let config = TreeLayoutConfig { node_width: 150.0, node_height: 80.0, level_distance: 100.0, sibling_distance: 50.0, subtree_distance: 80.0 };

    let tree = TreeNode::new("root".to_string(), "Root".to_string(), "root".to_string()).with_child(TreeNode::new("child".to_string(), "Child".to_string(), "child".to_string()));

    let layout_engine = TreeLayout::new().with_algorithm(TreeLayoutAlgorithm::Layered).with_config(config);

    let result = layout_engine.layout_tree(&tree);
    assert!(result.is_ok());
}

#[test]
fn test_tree_layout_config_default() {
    let config = TreeLayoutConfig::default();
    assert!(config.node_width > 0.0);
    assert!(config.node_height > 0.0);
    assert!(config.level_distance > 0.0);
    assert!(config.sibling_distance > 0.0);
    assert!(config.subtree_distance > 0.0);
}

#[test]
fn test_tree_renderer_creation() {
    let _renderer = TreeRenderer::new();
    // Just test that it can be created without panicking

    let custom_config = TreeRenderConfig {
        node_fill_color: "#FF0000".to_string(),
        node_stroke_color: "#000000".to_string(),
        node_stroke_width: 2.0,
        edge_color: "#666666".to_string(),
        edge_width: 1.5,
        text_color: "#333333".to_string(),
        font_family: "Arial".to_string(),
        font_size: 14.0,
    };

    let _custom_renderer = TreeRenderer::new().with_config(custom_config);
    // Test that custom config can be applied
}

#[test]
fn test_tree_render_config_default() {
    let config = TreeRenderConfig::default();
    assert!(!config.node_fill_color.is_empty());
    assert!(!config.node_stroke_color.is_empty());
    assert!(config.node_stroke_width > 0.0);
    assert!(!config.edge_color.is_empty());
    assert!(config.edge_width > 0.0);
    assert!(!config.text_color.is_empty());
    assert!(!config.font_family.is_empty());
    assert!(config.font_size > 0.0);
}

#[test]
fn test_empty_tree_layout() {
    let tree = TreeNode::new("single".to_string(), "Single".to_string(), "single".to_string());

    let layout_engine = TreeLayout::new().with_algorithm(TreeLayoutAlgorithm::Layered);
    let result = layout_engine.layout_tree(&tree);

    assert!(result.is_ok());
    let layout = result.unwrap();
    assert_eq!(layout.nodes.len(), 1);
    assert_eq!(layout.edges.len(), 0);
}

#[test]
fn test_all_layout_algorithms() {
    let tree = TreeNode::new("root".to_string(), "Root".to_string(), "root".to_string()).with_child(TreeNode::new("child".to_string(), "Child".to_string(), "child".to_string()));

    let algorithms = vec![TreeLayoutAlgorithm::Layered, TreeLayoutAlgorithm::Radial, TreeLayoutAlgorithm::Compact, TreeLayoutAlgorithm::Balloon];

    for algorithm in algorithms {
        let layout_engine = TreeLayout::new().with_algorithm(algorithm);
        let result = layout_engine.layout_tree(&tree);
        assert!(result.is_ok(), "Layout failed for algorithm: {:?}", algorithm);

        let layout = result.unwrap();
        assert_eq!(layout.nodes.len(), 2);
        assert_eq!(layout.edges.len(), 1);
    }
}