/** \file
 * \brief  Declares CPlanarEdgeInserter class.
 *
 * Reinsertion of deleted edges in embedded subgraph with
 * modeled cluster boundaries.
 * The inserter class computes a shortest path on the dual
 * graph of the input to find an insertion path
 *
 * \author Karsten Klein
 *
 * \par License:
 * This file is part of the Open Graph Drawing Framework (OGDF).
 *
 * \par
 * Copyright (C)<br>
 * See README.md in the OGDF root directory 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, see
 * http://www.gnu.org/copyleft/gpl.html
 */

#pragma once

#include <ogdf/cluster/ClusterPlanRep.h>

namespace ogdf {

//! Edge insertion algorithm for clustered graphs.
/**
 * @ingroup ga-cplanarity
 */
class OGDF_EXPORT CPlanarEdgeInserter {
	//! Postprocessing options
	enum class PostProcessType { None, RemoveReinsert };

public:
	CPlanarEdgeInserter() { }

	virtual ~CPlanarEdgeInserter() { }

	void call(ClusterPlanRep& CPR, CombinatorialEmbedding& E, const Graph& G,
			const List<edge>& origEdges);

	void setPostProcessing(PostProcessType p) { m_ppType = p; }

	PostProcessType getPostProcessing() { return m_ppType; }

protected:
	void constructDualGraph(ClusterPlanRep& CPR, CombinatorialEmbedding& E,
			EdgeArray<edge>& arcRightToLeft, EdgeArray<edge>& arcLeftToRight,
			FaceArray<node>& nodeOfFace,
			//NodeArray<face>& faceOfNode,
			EdgeArray<edge>& arcTwin);

	void findShortestPath(const CombinatorialEmbedding& E,
			node s, //edge startpoint
			node t, //edge endpoint
			node sDummy, //representing s in network
			node tDummy, //representing t in network
			SList<adjEntry>& crossed, FaceArray<node>& nodeOfFace);

	void insertEdge(ClusterPlanRep& CPR, CombinatorialEmbedding& E, edge insertMe,
			FaceArray<node>& nodeOfFace, EdgeArray<edge>& arcRightToLeft,
			EdgeArray<edge>& arcLeftToRight, EdgeArray<edge>& arcTwin,
			NodeArray<cluster>& clusterOfFaceNode, const SList<adjEntry>& crossed);

	void setArcStatus(edge eArc, node oSrc, node oTgt, const ClusterGraph& CG,
			NodeArray<cluster>& clusterOfFaceNode, EdgeArray<edge>& arcTwin);

	//! Use heuristics to improve the result if possible.
	void postProcess();

private:
	const Graph* m_originalGraph = nullptr;
	Graph m_dualGraph;
	EdgeArray<int> m_eStatus; //!< Status of dual graph arcs.
	EdgeArray<adjEntry> m_arcOrig; //!< Original edges adj entry.
	PostProcessType m_ppType = PostProcessType::None; //!< Defines which kind of postprocessing to use.

	//! Compute for every face the cluster that surrounds it.
	void deriveFaceCluster(ClusterPlanRep& CPR, CombinatorialEmbedding& E, const ClusterGraph& CG,
			FaceArray<node>& nodeOfFace, NodeArray<cluster>& clusterOfFaceNode);


	//debug
	void writeDual(const char* fileName);
	void writeGML(std::ostream& os, const Layout& drawing);
};

}
