/*
 * $Revision: 3388 $
 *
 * last checkin:
 *   $Author: gutwenger $
 *   $Date: 2013-04-10 14:56:08 +0200 (Wed, 10 Apr 2013) $
 ***************************************************************/

/** \file
 * \brief Declaration of a base class for planar representations
 *        of graphs and cluster graphs.
 *
 * \author Karsten Klein, Carsten Gutwenger
 *
 * \par License:
 * This file is part of the Open Graph Drawing Framework (OGDF).
 *
 * \par
 * Copyright (C)<br>
 * See README.txt in the root directory of the OGDF installation for details.
 *
 * \par
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * Version 2 or 3 as published by the Free Software Foundation;
 * see the file LICENSE.txt included in the packaging of this file
 * for details.
 *
 * \par
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * \par
 * You should have received a copy of the GNU General Public
 * License along with this program; if not, write to the Free
 * Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
 * Boston, MA 02110-1301, USA.
 *
 * \see  http://www.gnu.org/copyleft/gpl.html
 ***************************************************************/


// PlanRep should not know about generalizations and association,
// but we already set types in Attributedgraph, therefore set them
// in PlanRep, too

#ifdef _MSC_VER
#pragma once
#endif

#ifndef OGDF_PLANREP_H
#define OGDF_PLANREP_H


#include <ogdf/basic/GraphCopy.h>
#include <ogdf/planarity/EdgeTypePatterns.h>
#include <ogdf/planarity/NodeTypePatterns.h>
#include <ogdf/basic/Layout.h>
#include <ogdf/basic/GridLayout.h>
#include <ogdf/orthogonal/OrthoRep.h>


namespace ogdf {


//! Planarized representations (of a connected component) of a graph.
/**
 * Maintains types of edges (generalization, association) and nodes,
 * and the connected components of the graph.
 */
class OGDF_EXPORT PlanRep : public GraphCopy
{
public:
	//! Information for restoring degree-1 nodes.
	struct Deg1RestoreInfo
	{
		Deg1RestoreInfo() : m_eOriginal(0), m_deg1Original(0), m_adjRef(0) { }
		Deg1RestoreInfo(edge eOrig, node deg1Orig, adjEntry adjRef)
			: m_eOriginal(eOrig), m_deg1Original(deg1Orig), m_adjRef(adjRef) { }

		edge m_eOriginal;    //!< the original edge leading to the deg-1 node
		node m_deg1Original; //!< the original deg-1 node
		adjEntry m_adjRef;   //!< the reference adjacency entry for restoring the edge
	};


	//@{
	//! Creates a planarized representation of graph \a G.
	PlanRep(const Graph& G);

	//! Creates a planarized representation of graph \a AG.
	PlanRep(const GraphAttributes& AG);

	virtual ~PlanRep() { }

	//@}

	/**
	 * @name Processing connected components
	 * Planarized representations provide a mechanism for always representing
	 * a copy of a single component of the original graph.
	 */
	//@{

	//! Returns the number of connected components in the original graph.
	int numberOfCCs() const {
		return m_ccInfo.numberOfCCs();
	}

	//! Returns the index of the current connected component (-1 if not yet initialized).
	int currentCC() const {
		return m_currentCC;
	}

	//! Returns the connected components info structure.
	const CCsInfo &ccInfo() const { return m_ccInfo; }

	//! Returns the number of nodes in the current connected component.
	int numberOfNodesInCC() const { return numberOfNodesInCC(m_currentCC); }

	//! Returns the number of nodes in connected component \a cc.
	int numberOfNodesInCC(int cc) const {
		return stopNode(cc) - startNode(cc);
	}

	//! Returns node \a i in the list of all original nodes.
	node v(int i) const { return m_ccInfo.v(i); }

	//! Returns edge \a i in the list of all original edges.
	edge e(int i) const { return m_ccInfo.e(i); }

	//! Returns the index of the first node in this connected component.
	int startNode() const { return m_ccInfo.startNode(m_currentCC); }

	//! Returns the index of the first node in connected component \a cc.
	int startNode(int cc) const { return m_ccInfo.startNode(cc); }

	//! Returns the index of (one past) the last node in this connected component.
	int stopNode() const { return m_ccInfo.stopNode(m_currentCC); }

	//! Returns the index of (one past) the last node in connected component \a cc.
	int stopNode(int cc) const { return m_ccInfo.stopNode(cc); }

	//! Returns the index of the first edge in this connected component.
	int startEdge() const { return m_ccInfo.startEdge(m_currentCC); }

	//! Returns the index of (one past) the last edge in this connected component.
	int stopEdge() const { return m_ccInfo.stopEdge(m_currentCC); }

	//! Initializes the planarized representation for connected component \a cc.
	/**
	 * This initialization is always required. After performing this initialization,
	 * the planarized representation represents a copy of the connected
	 * component \a cc of the original graph, where connected components are numbered
	 * 0,1,2,...
	 */
	void initCC(int cc);

	//@}

	/**
	 * @name Node expansion
	 */
	//@{

	/**
	 * \brief Returns the adjacency entry of a node of an expanded face.
	 *
	 * If no such entry is stored at node \a v, 0 is returned.
	 */
	adjEntry expandAdj(node v) const {
		return m_expandAdj[v];
	}

	adjEntry& expandAdj(node v) {
		return m_expandAdj[v];
	}

	//@}
	/**
	 * @name Clique boundary
	 */
	//@{

	/**
	 * Returns the adjacency entry of the first edge of the inserted boundary
	 * at a center node (original) of a clique, 0 if no boundary exists
	 */
	adjEntry boundaryAdj(node v) const {
		return m_boundaryAdj[v];
	}

	/**
	 * Returns a reference to the adjacency entry of the first edge of the inserted boundary
	 * at a center node (original) of a clique, 0 if no boundary exists
	 */
	adjEntry& boundaryAdj(node v){
		return m_boundaryAdj[v];
	}

	//edge on the clique boundary, adjSource
	void setCliqueBoundary(edge e) {
		setEdgeTypeOf(e, edgeTypeOf(e) | cliquePattern());
	}
	bool isCliqueBoundary(edge e) {
		return ((edgeTypeOf(e) & cliquePattern()) == cliquePattern());
	}


	//@}
	/**
	 * @name Node types
	 */
	//@{

	/**
	 * \brief Returns the type of node \a v.
	 * @param v is a node in the planarized representation.
	 */
	Graph::NodeType typeOf(node v) const {
		return m_vType[v];
	}

	/**
	 * \brief Returns a reference to the type of node \a v.
	 * @param v is a node in the planarized representation.
	 */
	Graph::NodeType& typeOf(node v) {
		return m_vType[v];
	}

	/**
	 * \brief Returns true if the node represents a "real" object in the original graph.
	 *
	 * \todo It is necessary to check for several different possible types.
	 * This should be solved by combining representation types (vertex, dummy,...)
	 * with semantic types (class, interface,...) within GraphAttributes;
	 * we then can return to vertex only.
	 */
	inline bool isVertex(node v)
	{
		return ( (typeOf(v) == Graph::vertex) ||
			(typeOf(v) == Graph::associationClass));
	}

	/**
	 * \brief Returns the extended node type of \a v.
	 * @param v is a node in the planarized representation.
	 */
	nodeType nodeTypeOf(node v)
	{
		return m_nodeTypes[v];
	}

	/**
	 * \brief Classifies node \a v as a crossing.
	 * @param v is a node in the planarized representation.
	 */
	void setCrossingType(node v)
	{
		m_nodeTypes[v] |= ntTerCrossing << ntoTertiary;
	}

	/**
	 * \brief Returns true iff node \a v is classified as a crossing.
	 * @param v is a node in the planarized representation.
	 */
	bool isCrossingType(node v)
	{
		return (m_nodeTypes[v] &= (ntTerCrossing << ntoTertiary)) != 0;
	}

	//@}
	/**
	 * @name Edge types
	 */
	//@{

	/**
	 * \brief Returns the type of edge \a e.
	 * @param e is an edge in the planarized representation.
	 */
	EdgeType typeOf(edge e) const {
		return m_eType[e];
	}

	/**
	 * \brief Returns a reference to the type of edge \a e.
	 * @param e is an edge in the planarized representation.
	 */
	EdgeType& typeOf(edge e) {
		return m_eType[e];
	}

	/**
	 * \brief Returns a reference to the type of original edge \a e.
	 * @param e is an edge in the original graph.
	 */
	edgeType& oriEdgeTypes(edge e)
	{
		return m_oriEdgeTypes[e];
	}

	/**
	 * \brief Returns the new type field of \a e.
	 * @param e is an edge in the planarized representation.
	 */
	edgeType edgeTypeOf(edge e)
	{
		return m_edgeTypes[e];
	}

	/**
	 * \brief Returns a reference to the new type field of \a e.
	 * @param e is an edge in the planarized representation.
	 */
	edgeType& edgeTypes(edge e)
	{
		return m_edgeTypes[e];
	}

	/**
	 * \brief Sets the new type field of edge \a e to \a et.
	 * @param e is an edge in the planarized representation.
	 * @param et is the type assigned to \a e.
	 */
	void setEdgeTypeOf(edge e, edgeType et)
	{
		m_edgeTypes[e] = et;
	}

	/**
	 * \brief Set both type values of \a e at once.
	 *
	 * This is a temporary solution that sets both type values; this way, all
	 * additional edge types in the new field are lost.
	 * @param e is an edge in the planarized representation.
	 * @param et is the type assigned to \a e.
	 */
	void setType(edge e, EdgeType et)
	{
		m_eType[e] = et;
		switch (et)
		{
			case Graph::association: m_edgeTypes[e] = etcPrimAssociation;break;
			case Graph::generalization: m_edgeTypes[e] = etcPrimGeneralization;
				break;
			case Graph::dependency: m_edgeTypes[e] = etcPrimDependency; break;
			default: break;
		}
	}

	//-------------------------------------------------------------------------
	//new edge types
	//to set or check edge types use the pattern function in the private section

	//-------------------
	//primary level types

	//! Returns true iff edge \a e is classified as generalization.
	bool isGeneralization(edge e) {
		bool check = (((m_edgeTypes[e] & etpPrimary) & etcPrimGeneralization) == etcPrimGeneralization);
		return check;
	}

	//! Classifies edge \a e as generalization (primary type).
	void setGeneralization(edge e) {
		setPrimaryType(e, etcPrimGeneralization);

		//preliminary set old array too
		m_eType[e] = generalization; //can be removed if edgetypes work properly
	}

	//! Returns true iff edge \a e is classified as dependency.
	bool isDependency(edge e) {
		bool check = (((m_edgeTypes[e] & etpPrimary) & etcPrimDependency) == etcPrimDependency);
		return check;
	}

	//! Classifies edge \a e as dependency (primary type).
	void setDependency(edge e) {
		setPrimaryType(e, etcPrimDependency);

		//preliminary set old array too
		m_eType[e] = dependency; //can be removed if edgetypes work properly
	}

	//! Classifies edge \a e as association (primary type).
	void setAssociation(edge e) {
		setPrimaryType(e, etcPrimAssociation);

		//preliminary set old array too
		m_eType[e] = association; //can be removed if edgetypes work properly
	}

	//------------------
	//second level types

	//in contrast to setsecondarytype: do not delete old value

	//! Classifies edge \a e as expansion edge (secondary type).
	void setExpansion(edge e) {
		m_edgeTypes[e] |= expansionPattern();

		//preliminary set old array too
		m_expansionEdge[e] = 1;//can be removed if edgetypes work properly
	}

	//! Returns true iff edge \a e is classified as expansion edge.
	bool isExpansion(edge e) {
		return ((m_edgeTypes[e] & expansionPattern()) == expansionPattern());
	}

	//should add things like cluster and clique boundaries that need rectangle shape

	//! Returns true iff edge \a e is a clique boundary.
	bool isBoundary(edge e) {
		return isCliqueBoundary(e); }

	//--------------
	//tertiary types

	//! Classifies edge \a e as connection at an association class (tertiary type).
	void setAssClass(edge e)
	{
		m_edgeTypes[e] |= assClassPattern();
	}

	//! Returns true iff edge \a e is classified as connection at an association class.
	bool isAssClass(edge e)
	{
		return ((m_edgeTypes[e] & assClassPattern()) == assClassPattern());
	}


	//------------------
	//fourth level types

	//! Classifies edge \a e as connection between hierarchy neighbours (fourth level type).
	void setBrother(edge e) {
		m_edgeTypes[e] |= brotherPattern();
	}

	//! Classifies edge \a e as connection between ...  (fourth level type).
	void setHalfBrother(edge e) {
		m_edgeTypes[e] |= halfBrotherPattern();
	}

	//! Returns true if edge \a e is classified as brother.
	bool isBrother(edge e) {
		return ( (((m_edgeTypes[e] & etpFourth) & brotherPattern())>> etoFourth) == etcBrother);
	}

	//! Returns true if edge \a e is classified as half-brother.
	bool isHalfBrother(edge e) {
		return ( (((m_edgeTypes[e] & etpFourth) & halfBrotherPattern())>> etoFourth) == etcHalfBrother);
	}

	//-----------------
	//set generic types

	//! Sets type of edge \a e to current type (bitwise) AND \a et.
	edgeType edgeTypeAND(edge e, edgeType et) {m_edgeTypes[e] &= et; return m_edgeTypes[e];}

	//! Sets type of edge \a e to current type (bitwise) OR \a et.
	edgeType edgeTypeOR(edge e, edgeType et) {m_edgeTypes[e] |= et; return m_edgeTypes[e];}

	//! Sets primary edge type of edge \a e to primary edge type in \a et (deletes old primary value).
	void setPrimaryType(edge e, edgeType et) {
		m_edgeTypes[e] &= 0xfffffff0;
		m_edgeTypes[e] |= (etpPrimary & et);
	}

	//! Sets secondary edge type of edge \a e to primary edge type in \a et.
	void setSecondaryType(edge e, edgeType et) {
		m_edgeTypes[e] &= 0xffffff0f;
		m_edgeTypes[e] |= (etpSecondary & ( et << etoSecondary));
	}

	//! Sets primary type of \a e to bitwise AND of \a et's primary value and old value.
	edgeType edgeTypePrimaryAND(edge e, edgeType et) {m_edgeTypes[e] &= (etpAll & et); return m_edgeTypes[e];}

	//! Sets primary type of \a e to bitwise OR of \a et's primary value and old value.
	edgeType edgeTypePrimaryOR(edge e, edgeType et) {m_edgeTypes[e] |= et; return m_edgeTypes[e];}

	//! Sets user defined type locally.
	void setUserType(edge e, edgeType et)
	{
		OGDF_ASSERT( et < 147);
		m_edgeTypes[e] |= (et << etoUser);
	}

	//! Returns user defined type.
	bool isUserType(edge e, edgeType et)
	{
		OGDF_ASSERT( et < 147);
		return ( (m_edgeTypes[e] & (et << etoUser)) == (et << etoUser));
	}

	//---------------
	//
	// old edge types

	//this is pure nonsense, cause we have uml-edgetype and m_etype, and should be able to
	//use them with different types, but as long as they arent used correctly (switch instead of xor),
	//use this function to return if e is expansionedge
	//if it is implemented correctly later, delete the array and return m_etype == Graph::expand
	//(the whole function then is obsolete, cause you can check it directly, but for convenience...)
	//should use genexpand, nodeexpand, dissect instead of bool

	//! Sets the expansion edge type of \ e to \a expType.
	void setExpansionEdge(edge e, int expType) {
		m_expansionEdge[e] = expType;
	}

	//! Returns if \a e is an expansion edge.
	bool isExpansionEdge(edge e) const {
		return (m_expansionEdge[e] > 0);
	}

	//! Returns the expansion edge type of \a e.
	int expansionType(edge e) const { return m_expansionEdge[e]; }

	//precondition normalized
	//! Returns if \a e is a degree expansion edge.
	bool isDegreeExpansionEdge(edge e) const {
		//return (m_eType[e] == Graph::expand);
		return ( m_expansionEdge[e]  == 2);
	}


	//@}
	/**
	 * @name Access to attributes in original graph
	 * These methods provide easy access to attributes of original nodes and
	 * edges.
	 */
	//@{


	//! Gives access to the node array of the widths of original nodes.
	const NodeArray<double> &widthOrig() const {
		return m_pGraphAttributes->width();
	}

	//! Returns the width of original node \a v.
	double widthOrig(node v) const {
		return m_pGraphAttributes->width(v);
	}

	//! Gives access to the node array of the heights of original nodes.
	const NodeArray<double> &heightOrig() const {
		return m_pGraphAttributes->height();
	}

	//! Returns the height of original node \a v.
	double heightOrig(node v) const {
		return m_pGraphAttributes->height(v);
	}

	//! Returns the type of original edge \a e.
	EdgeType typeOrig(edge e) const {
		return m_pGraphAttributes->type(e);
	}

	//! Returns the graph attributes of the original graph (the pointer may be 0).
	const GraphAttributes &getGraphAttributes() const {
		return *m_pGraphAttributes;
	}

	//@}
	/**
	 * @name Structural alterations
	 */
	//@{

	// Expands nodes with degree > 4 and merge nodes for generalizations
	virtual void expand(bool lowDegreeExpand = false);

	void expandLowDegreeVertices(OrthoRep &OR);

	void collapseVertices(const OrthoRep &OR, Layout &drawing);
	void collapseVertices(const OrthoRep &OR, GridLayout &drawing);

	void removeCrossing(node v); //removes the crossing at node v

	//model a boundary around a star subgraph centered at center
	//and keep external face information (outside the clique
	void insertBoundary(node center, adjEntry& adjExternal);


	//@}
	/**
	 * @name Extension of methods defined by GraphCopys
	 */
	//@{

	//! Splits edge \a e.
	virtual edge split(edge e);


	//returns node which was expanded using v
	node expandedNode(node v) const { return m_expandedNode[v]; }

	void setExpandedNode(node v, node w) { m_expandedNode[v] = w; }


	//@}
	/**
	 * @name Creation of new nodes and edges
	 */
	//@{

	/**
	 * \brief Creates a new node with node type \a vType in the planarized representation.
	 * @param vOrig becomes the original node of the new node.
	 * @param vType becomes the type of the new node.
	 */
	node newCopy(node vOrig, Graph::NodeType vType);

	/**
	 * \brief Creates a new edge in the planarized representation.
	 * @param v is the source node of the new edge.
	 * @param adjAfter is the adjacency entry at the target node, after which the
	 *        new edge is inserted.
	 * @param eOrig becomes the original edge of the new edge.
	 */
	edge newCopy(node v, adjEntry adjAfter, edge eOrig);

	/**
	 * \brief Creates a new edge in the planarized representation while updating the embedding \a E.
	 * @param v is the source node of the new edge.
	 * @param adjAfter is the adjacency entry at the target node, after which the
	 *        new edge is inserted.
	 * @param eOrig becomes the original edge of the new edge.
	 * @param E is an embedding of the planarized representation.
	 */
	edge newCopy(node v, adjEntry adjAfter, edge eOrig, CombinatorialEmbedding &E);


	//@}
	/**
	 * @name Crossings
	 */
	//@{

	//! Re-inserts edge \a eOrig by "crossing" the edges in \a crossedEdges.
	/**
	 * Splits each edge in crossedEdges.
	 *
	 * \pre \a eOrig is an edge in the original graph and the edges in \a crossedEdges are in this graph.
	 */
	void insertEdgePath(edge eOrig, const SList<adjEntry> &crossedEdges);

	//! Same as insertEdgePath, but for embedded graphs.
	void insertEdgePathEmbedded(
		edge eOrig,
		CombinatorialEmbedding &E,
		const SList<adjEntry> &crossedEdges);

	//! Removes the complete edge path for edge \a eOrig while preserving the embedding.
	/**
	 * \pre \a eOrig s an edge in the original graph.
	 */
	void removeEdgePathEmbedded(CombinatorialEmbedding &E,
		edge eOrig,
		FaceSetPure &newFaces) {
		GraphCopy::removeEdgePathEmbedded(E,eOrig,newFaces);
	}

	//! Inserts crossings between two copy edges.
	/**
	 * This method is used in TopologyModule.
	 *
	 * Let \a crossingEdge = (\a a, \a b) and \a crossedEdge = (\a v, \a w).
	 * Then \a crossedEdge is split creating two edges \a crossedEdge = (\a v, \a u)
	 * and (\a u, \a w), \a crossingEdge is removed and replaced by two new edges
	 * \a e1  = (\a a, \a u) and \a e1 = (\a u, \a b).
	 * Finally it sets \a crossingEdge to \a e2 and returns (\a u, \a w).
	 *
	 * @param crossingEdge is the edge that gets split.
	 * @param crossedEdge is the edge that is replaced by two new edges.
	 * @param topDown is used as follows: If set to true, \a crossingEdge will cross
	 *        \a crossedEdge from right to left, otherwise from left to right.
	*/
	edge insertCrossing(
		edge &crossingEdge,
		edge crossedEdge,
		bool topDown);

	//@}
	/**
	 * @name Degree-1 nodes
	 * These methods realize a mechanism for temporarily removing degree-1 nodes.
	 */
	//@{

	/**
	 * \brief Removes all marked degree-1 nodes from the graph copy and stores restore information in \a S.
	 * @param S returns the restore information required by restoreDeg1Nodes().
	 * @param mark defines which nodes are marked for removal; all nodes \a v with
	 *        <I>mark</I>[<I>v</I>]=<B>true</B> are removed.
	 * \pre Only nodes with degree 1 may be marked.
	 */
	void removeDeg1Nodes(Stack<Deg1RestoreInfo> &S, const NodeArray<bool> &mark);

	/**
	 * \brief Restores degree-1 nodes previously removed with removeDeg1Nodes().
	 * @param S contains the restore information.
	 * @param deg1s returns the list of newly created nodes in the copy.
	 */
	void restoreDeg1Nodes(Stack<Deg1RestoreInfo> &S, List<node> &deg1s);

	//@}
	void writeGML(const char *fileName, const OrthoRep &OR, const GridLayout &drawing);
	void writeGML(ostream &os, const OrthoRep &OR, const GridLayout &drawing);

protected:

	int m_currentCC; //!< The index of the current component.
	Graph::CCsInfo m_ccInfo;
	//int m_numCC;     //!< The number of components in the original graph.

	//Array<List<node> >  m_nodesInCC; //!< The list of original nodes in each component.

	const GraphAttributes* m_pGraphAttributes; //!< Pointer to graph attributes of original graph.

	//------------
	//object types

	//set the type of eCopy according to the type of eOrig
	//should be virtual if PlanRepUML gets its own
	void setCopyType(edge eCopy, edge eOrig);

	//helper to cope with the edge types, shifting to the right place
	edgeType generalizationPattern() {return etcPrimGeneralization;}
	edgeType associationPattern()    {return etcPrimAssociation;}
	edgeType expansionPattern()      {return etcSecExpansion << etoSecondary;}
	edgeType assClassPattern()       {return etcAssClass << etoTertiary;}
	edgeType brotherPattern()        {return etcBrother   << etoFourth;}
	edgeType halfBrotherPattern()    {return etcHalfBrother   << etoFourth;}
	edgeType cliquePattern()         {return etcSecClique << etoSecondary;} //boundary


//--------------------------------------------------------------------------

	NodeArray<NodeType> m_vType; //!< Simple node types.

	NodeArray<nodeType> m_nodeTypes; //!< Node types for extended semantic information.

	NodeArray<node>     m_expandedNode; //!< For all expansion nodes, save expanded node.
	NodeArray<adjEntry> m_expandAdj;

	//clique handling: We save an adjEntry of the first edge of an inserted
	//boundary around a clique at its center v
	NodeArray<adjEntry> m_boundaryAdj;

	//zusammenlegbare Typen
	EdgeArray<int>      m_expansionEdge; //1 genmerge, 2 degree (2 highdegree, 3 lowdegree)
	EdgeArray<EdgeType> m_eType;

	//m_edgeTypes stores semantic edge type information on several levels:
	//primary type: generalization, association,...
	//secondary type: merger,...
	//tertiary type: vertical in hierarchy, inner, outer, ...
	//fourth type: neighbour relation (brother, cousin in hierarchy)
	//user types: user defined for local changes
	EdgeArray<edgeType> m_edgeTypes; //store all type information

	//workaround fuer typsuche in insertedgepathembed
	//speichere kopietyp auf originalen
	//maybe it's enough to set gen/ass without extra array
	EdgeArray<edgeType> m_oriEdgeTypes;

	EdgeArray<edge>     m_eAuxCopy; // auxiliary (GraphCopy::initByNodes())

};//PlanRep

} // end namespace ogdf


#endif
