Skip to content
GitLab
Menu
Projects
Groups
Snippets
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
Olena
pylene
Commits
bf7a0266
Commit
bf7a0266
authored
Oct 12, 2021
by
Baptiste Esteban
Browse files
Finish GoS computation test
parent
8c526ab9
Pipeline
#30558
passed with stages
in 19 minutes and 4 seconds
Changes
1
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
tests/morpho/mtos.cpp
View file @
bf7a0266
...
@@ -17,6 +17,39 @@ TEST(Morpho, GoS)
...
@@ -17,6 +17,39 @@ TEST(Morpho, GoS)
{{
255
,
75
,
0
},
{
31
,
174
,
0
},
{
255
,
75
,
0
},
{
31
,
174
,
0
},
{
255
,
146
,
0
}},
//
{{
255
,
75
,
0
},
{
31
,
174
,
0
},
{
255
,
75
,
0
},
{
31
,
174
,
0
},
{
255
,
146
,
0
}},
//
};
};
std
::
vector
<
std
::
set
<
int
>>
graph_ref
=
{
//
{},
// 0
{
0
},
// 1
{
0
,
1
},
// 2
{
0
,
1
,
14
},
// 3
{
0
,
1
,
20
},
// 4
{
0
,
1
,
24
},
// 5
{
0
,
1
,
14
},
// 6
{
0
,
1
,
14
},
// 7
{
0
,
7
,
19
},
// 8
{
0
,
1
,
22
},
// 9
{
0
,
14
},
// 10
{
0
,
10
,
14
},
// 11
{
0
,
11
,
15
},
// 12
{
0
,
16
},
// 13
{
0
},
// 14
{
0
,
10
,
14
},
// 15
{
0
,
14
},
// 16
{
0
,
16
,
29
},
// 17
{
0
,
16
},
// 18
{
0
,
1
,
14
},
// 19
{
0
,
1
,
14
},
// 20
{
0
,
7
,
14
},
// 21
{
0
,
1
,
14
},
// 22
{
0
,
7
,
22
},
// 23
{
0
,
1
,
14
},
// 24
{
6
,
24
,
28
},
// 25
{
0
,
10
,
15
},
// 26
{
0
,
1
,
20
},
// 27
{
0
,
1
,
14
},
// 28
{
0
,
14
},
// 29
{
0
,
1
,
19
}};
std
::
vector
<
std
::
vector
<
int
>>
tree_to_graph_ref
=
{{
0
,
1
,
2
,
3
,
4
,
5
,
6
,
7
,
8
,
9
,
10
,
11
,
12
,
13
},
std
::
vector
<
std
::
vector
<
int
>>
tree_to_graph_ref
=
{{
0
,
1
,
2
,
3
,
4
,
5
,
6
,
7
,
8
,
9
,
10
,
11
,
12
,
13
},
{
0
,
2
,
14
,
15
,
16
,
17
,
18
,
19
,
20
,
21
,
22
,
23
,
24
,
25
},
{
0
,
2
,
14
,
15
,
16
,
17
,
18
,
19
,
20
,
21
,
22
,
23
,
24
,
25
},
{
0
,
26
,
27
,
28
,
29
,
30
}};
{
0
,
26
,
27
,
28
,
29
,
30
}};
...
@@ -35,6 +68,13 @@ TEST(Morpho, GoS)
...
@@ -35,6 +68,13 @@ TEST(Morpho, GoS)
// Check number of nodes in the GoS
// Check number of nodes in the GoS
ASSERT_EQ
(
graph
.
size
(),
31
);
ASSERT_EQ
(
graph
.
size
(),
31
);
for
(
int
i
=
0
;
i
<
(
int
)
graph
.
size
();
i
++
)
{
ASSERT_EQ
(
graph
[
i
].
size
(),
graph_ref
[
i
].
size
());
auto
ref_it
=
graph_ref
[
i
].
begin
();
for
(
auto
it
=
graph
[
i
].
begin
();
it
!=
graph
[
i
].
end
();
it
++
)
ASSERT_EQ
(
*
ref_it
++
,
*
it
);
}
// Compare the map tree node -> graph node
// Compare the map tree node -> graph node
for
(
int
i
=
0
;
i
<
3
;
i
++
)
for
(
int
i
=
0
;
i
<
3
;
i
++
)
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment