Ore-graph to Bipartite P-graph conversion

From InterSciWiki

Klaus wrote a contraction that converts Ore-graphs to P-graphs in his new Puck software. Obvious advantage is that the kinship lines then become conceptually independent, no automatic Parents' child=sibling links (automatic triads) for example.

This could be done by identifying the H-W marriage node pairs (you have to specify the type of edge that defines marriage) and a new node is created for each such pair. This works find if all the relations are Ore-Graph but if there are other relations as well, they are duplicated for each ego in multiple marriages, so you get the nonindependence problem there again.

Thus it would make sense to have an Ore-graphs (and whatever other relations) to Bipartite P-graphs option. The new nodes are the marriages, and the individual non-kinship relations remain anchored to the individuals. The the individual-to-individual ties are nicely separated from the kinship ties, the visualization works and also the ties are all conceptually independent, so that k-cohesion analysis can be done meaningfully.