sga: a program that constructs a tree decomposition of a graph.
The approach consists first in performing recursively decompositions of the graph, building ta partition of the vertices A-B-C such that there are no edge of G between vertices of A and B. C is the separator.
Then the resulting decomposition is improved applying pullup and swap operations while the height of the decomposition decreases.
Type make to build the program named treedepth. Type ./treedepth -help to print usage information.
For example ./treedepth -file heur_111.gr time 60.
Use make PACE=yes to generate a version of the program corresponding to pace 2020 requirements.