I have a set of elements on which I defined a given relationship that allowed me to define a partial order on the set. I then introduced a second relationship to be applied to elements that were not comparable through the first relationship. This leads to a sort of layered graph where the nodes in each layer are not individual nodes, but instead subgraphs with multiple nodes, such that:
- Each subgraph is in itself a layered graph (that could be represented with a Hasse diagram)
- Connections between the top-level layers are only established between nodes of the top sublevel of a given subgraph and nodes of the bottom sublevel of a given subgraph of the next layer in the top-level hierarchy.
- The entire graph should be symmetric around the Y axis
I guess it would end up being similar to a nested Hasse diagram. Is there any relatively straightforward way that I could plot this? Ideally, having control over how much weight (reflected in how much change in position along the Y axis) each order relationship has.