Refactor quad tree, quad graph, and about number of splits

[loreloc]

Currently, we have a quad tree function, which can possibly returns a quad graph. We should simplify things and match the nomenclature with the papers, i.e., by having a quad graph function.

[gengala]

Yes, it would be better if we had a function that by default returns a quad graph. This function takes as input two main args:

• is_tree [bool]: which if true returns a quad tree
• num_patch_splits [int]: The number of patches a bigger patch is split into, e.g. 2 or 4. For the paper we used 4 for quad trees and 2 for quad graphs.

minor priority: imagine we are splitting a patch in two parts, this splitting may be performed vertically or horizontally.

[arranger1044]

agreed