Unlike the JAMR aligner, our heuristics ensure that exactly one node in each elementary graph is marked as the root, i.e.
it is technically much more challenging to parse a string into a graph than into a tree.