agent_compositor_test/references/igraph-1.0.1/tests/unit/symmetric_tree.out

Singleton graph
directed: false
vcount: 1
edges: {
}

Directed singleton graph
directed: true
vcount: 1
edges: {
}

Undirected graph with 2 vertices and 1 edge
directed: false
vcount: 2
edges: {
0 1
}

Directed graph with 2 vertices and 1 edge
directed: true
vcount: 2
edges: {
1 0
}

Directed path graph with 4 level and 1 child in each
directed: true
vcount: 4
edges: {
0 1
1 2
2 3
}

Undirected path graph with 4 level and 1 child in each
directed: false
vcount: 4
edges: {
0 1
1 2
2 3
}

Binary out-tree with 3 vertices
directed: true
vcount: 3
edges: {
0 1
0 2
}

Undirected binery tree with 3 vertices
directed: false
vcount: 3
edges: {
0 1
0 2
}

Symmetric out-tree with 2 level, 3 children in each
directed: true
vcount: 13
edges: {
0 1
0 2
0 3
1 4
1 5
1 6
2 7
2 8
2 9
3 10
3 11
3 12
}

Symmetric undirected tree with 2 level, 3 children in each
directed: false
vcount: 13
edges: {
0 1
0 2
0 3
1 4
1 5
1 6
2 7
2 8
2 9
3 10
3 11
3 12
}

Symmetric out-tree with 2 level, 3 children in first, 4 in second
directed: true
vcount: 16
edges: {
0 1
0 2
0 3
1 4
1 5
1 6
1 7
2 8
2 9
2 10
2 11
3 12
3 13
3 14
3 15
}

Undirected symmetric tree with 2 level, 4 children in first, 3 in second
directed: false
vcount: 17
edges: {
0 1
0 2
0 3
0 4
1 5
1 6
1 7
2 8
2 9
2 10
3 11
3 12
3 13
4 14
4 15
4 16
}

Undirected symmetric tree with 3 level, 3 children in first, 4 in second, 5 in third
directed: false
vcount: 76
edges: {
0 1
0 2
0 3
1 4
1 5
1 6
1 7
2 8
2 9
2 10
2 11
3 12
3 13
3 14
3 15
4 16
4 17
4 18
4 19
4 20
5 21
5 22
5 23
5 24
5 25
6 26
6 27
6 28
6 29
6 30
7 31
7 32
7 33
7 34
7 35
8 36
8 37
8 38
8 39
8 40
9 41
9 42
9 43
9 44
9 45
10 46
10 47
10 48
10 49
10 50
11 51
11 52
11 53
11 54
11 55
12 56
12 57
12 58
12 59
12 60
13 61
13 62
13 63
13 64
13 65
14 66
14 67
14 68
14 69
14 70
15 71
15 72
15 73
15 74
15 75
}