Merging graphs
[Graph composition]


enum  abstractMixedGraph::TMergeLayoutMode {
  abstractMixedGraph::MERGE_ALIGN_RIGHT = 0,
  abstractMixedGraph::MERGE_ALIGN_BELOW = 1,
  abstractMixedGraph::MERGE_OVERLAY = 2


void abstractMixedGraph::AddGraphByNodes (abstractMixedGraph &G, TMergeLayoutMode mergeLayoutMode=MERGE_OVERLAY) throw (ERRejected)
void abstractMixedGraph::FacetIdentification (abstractMixedGraph &G) throw (ERRejected)

Enumeration Type Documentation

enum TMergeLayoutMode [inherited]

Merge display modes.

MERGE_ALIGN_RIGHT  Merged graph is displayed right-hand of the current graph.
MERGE_ALIGN_BELOW  Merged graph is displayed below of the current graph.
MERGE_OVERLAY  Merged graph is overlayed with the current graph.

Function Documentation

void AddGraphByNodes abstractMixedGraph G,
TMergeLayoutMode  mergeLayoutMode = MERGE_OVERLAY
throw (ERRejected) [inherited]

Disjoint merge of another graph into this object.

G The graph to be merged
mergeLayoutMode The display position of the merged graph, relative to the current graph
The copy of G is node disjoint with the former destination graph. That is, the resulting graph has at least two connected components.

void FacetIdentification abstractMixedGraph G  )  throw (ERRejected) [inherited]

Fill the appropriate faces with copies of another graph.

G The graph to be merged
This copies G several times into this object, namely for every face of this object which has the same length as the exterior face of G. This graph must provide a planar representation, and G must provide an exterior arc. It is not required that G is planar, but only that an orbit of exterior arcs is given. In the resulting graph, this exterior orbit of G is identified with the faces of this graph, and the interior of G subdivides the faces of this graph. If G is planar (represented), so is the merge result.

The procedure also determines a geometric representation, if both this graph and G provide 2D or 3D straight line drawings. Supposed that all relevant faces are regular polygones, G is rotated and scaled as expected. Then in the 2D setting, a plane drawing results. In the 3D setting, Observe that a convex drawing results only in special circumstances.