Trees

In this page we provide several trees. Some of them correspond to spanning trees of our datasets of graphs and others correspond to the tree representation of our datasets of balanced parenthesis sequences.

To read the datasets and create new ones, use this code.

Format of the datasets

Each dataset has the following format:

For each node v, the edges of v are listed in counterclockwise order, starting with the edge toward the parent of v (except to root). All the nodes are identified by an index. All the indices belongs to the range [0,n-1], where n is the number of nodes of the tree. By default, we assume that the root of the tree has index 0. Below, there is an example of the format.

Tree:

Format:

6
0 1
0 2
0 3
1 0
1 4
1 5
2 0
3 0
4 1
5 1