This package provides tree decomposition algorithms.
A tree decomposition of a simple, loopless, undirected graph G is a tree
T with bags at its nodes containing vertices from G. The usual
conditions apply. By convention, a tree is an acyclic graph with exactly
one connected component. The bagsize of T is the size of the biggest
bag, which is a notion for the (width of T)+1.
