SingletonMerge_DiffRootSamePar.dot

digraph "" {
    graph[dpi="60";compound="true"];

    subgraph L {
        node[shape="none"];
        left[shape="invtriangle";label="x"];
        leftroot[label="a"];

        left -> leftroot[dir="back"];
    }

    subgraph AB {
        temp1[shape="none";label="+"];
    }

    subgraph R {
        right[shape="invtriangle";label="x"];
        rightroot[shape="none";label="b"];

        right -> rightroot[dir="back"];
    }

    subgraph BC {
        node[color="invis";shape="point"];
        temp2b;
        temp2c;

        temp2b -> temp2c[constraint="false";label="wwwwwww";fontcolor="invis"];
    }

    subgraph clusterRes {
        color="invis";
        resulttree[shape="invtriangle";label="x"];
        result[shape="record";label="{<a> | a} | {<b> | b}"];

        resulttree -> result:a:n[dir="back"];
        resulttree -> result:b:n[dir="back"];
    }
}