| @@ 191-211 (lines=21) @@ | ||
| 188 | Tree.children[0], out) |
|
| 189 | ||
| 190 | ||
| 191 | def test_create_node_with_negation_dict_for_sigmaJs3(): |
|
| 192 | out = { |
|
| 193 | 'type': 'circle', |
|
| 194 | 'borderColor': '#ff0000', |
|
| 195 | 'color': '#00ff00', |
|
| 196 | 'id': 2, |
|
| 197 | 'label': '2', |
|
| 198 | 'size': 3, |
|
| 199 | 'text': None, |
|
| 200 | 'url': 'null', |
|
| 201 | 'title': 2, |
|
| 202 | 'x': 0, |
|
| 203 | 'y': 0 |
|
| 204 | } |
|
| 205 | Tree = graph.oval_graph.OvalNode(1, 'operator', 'and', False, None, [ |
|
| 206 | graph.oval_graph.OvalNode(2, 'value', "false", True, None) |
|
| 207 | ] |
|
| 208 | ) |
|
| 209 | ||
| 210 | tests.any_test_help.any_test_create_node_dict_for_sigmaJs( |
|
| 211 | Tree.children[0], out) |
|
| 212 | ||
| 213 | ||
| 214 | def test_create_edge_dict_for_sigmaJs(): |
|
| @@ 168-188 (lines=21) @@ | ||
| 165 | tests.any_test_help.any_test_create_node_dict_for_sigmaJs(Tree, out) |
|
| 166 | ||
| 167 | ||
| 168 | def test_create_node_with_negation_dict_for_sigmaJs2(): |
|
| 169 | out = { |
|
| 170 | 'type': 'circle', |
|
| 171 | 'borderColor': '#00ff00', |
|
| 172 | 'color': '#ff0000', |
|
| 173 | 'id': 2, |
|
| 174 | 'label': '2', |
|
| 175 | 'size': 3, |
|
| 176 | 'text': None, |
|
| 177 | 'url': 'null', |
|
| 178 | 'title': 2, |
|
| 179 | 'x': 0, |
|
| 180 | 'y': 0 |
|
| 181 | } |
|
| 182 | Tree = graph.oval_graph.OvalNode(1, 'operator', 'and', False, None, [ |
|
| 183 | graph.oval_graph.OvalNode(2, 'value', "true", True, None) |
|
| 184 | ] |
|
| 185 | ) |
|
| 186 | ||
| 187 | tests.any_test_help.any_test_create_node_dict_for_sigmaJs( |
|
| 188 | Tree.children[0], out) |
|
| 189 | ||
| 190 | ||
| 191 | def test_create_node_with_negation_dict_for_sigmaJs3(): |
|