1No vertices:
2Is chordal: 1
3Fill in:
4( )
5New graph:
6directed: false
7vcount: 0
8edges: {
9}
10
11One vertex:
12Is chordal: 1
13Fill in:
14( )
15New graph:
16directed: false
17vcount: 1
18edges: {
19}
20
21One vertex, don't calculate anything.
22
23Disconnected graph with loops and multiple edges:
24Is chordal: 0
25Fill in:
26( 3 0 )
27New graph:
28directed: false
29vcount: 6
30edges: {
310 1
320 2
330 2
340 2
350 3
361 1
371 3
382 3
393 4
403 4
41}
42
43Same graph, don't ask for fill_in vector:
44Is chordal: 0
45Fill in:
46( )
47New graph:
48directed: false
49vcount: 6
50edges: {
510 1
520 2
530 2
540 2
550 3
561 1
571 3
582 3
593 4
603 4
61}
62
63Same graph, don't ask for fill_in vector or newgraph:
64Is chordal: 0
65Fill in:
66( )
67
68Same graph, own calculation of alpha and its inverse:
69Is chordal: 0
70Fill in:
71( 3 0 )
72New graph:
73directed: false
74vcount: 6
75edges: {
760 1
770 2
780 2
790 2
800 3
811 1
821 3
832 3
843 4
853 4
86}
87
88Same graph, own calculation of alpha:
89Is chordal: 0
90Fill in:
91( 3 0 )
92New graph:
93directed: false
94vcount: 6
95edges: {
960 1
970 2
980 2
990 2
1000 3
1011 1
1021 3
1032 3
1043 4
1053 4
106}
107
108Same graph, own calculation of inverse alpha:
109Is chordal: 0
110Fill in:
111( 3 0 )
112New graph:
113directed: false
114vcount: 6
115edges: {
1160 1
1170 2
1180 2
1190 2
1200 3
1211 1
1221 3
1232 3
1243 4
1253 4
126}
127
128Wrong size alpha.
129Wrong size alpham1.
130