/** \file
 * \brief Declaration of a constraint class for the Branch&Cut algorithm
 * for the Maximum C-Planar SubGraph problem.
 *
 * These constraints represent the planarity-constraints belonging to the
 * ILP formulation. These constraints are dynamically separated.
 * For the separation the planarity test algorithm by Boyer and Myrvold is used.
 *
 * \author Mathias Jansen
 *
 * \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
 */

#include <ogdf/basic/Graph.h>
#include <ogdf/basic/List.h>
#include <ogdf/cluster/internal/MaxPlanarEdgesConstraint.h>

#include <ogdf/external/abacus.h>


using namespace ogdf;
using namespace ogdf::cluster_planarity;
using namespace abacus;

MaxPlanarEdgesConstraint::MaxPlanarEdgesConstraint(Master* master, int edgeBound,
		List<NodePair>& edges)
	: Constraint(master, nullptr, CSense::Less, edgeBound, false, false, true) {
	m_graphCons = false;
	for (const NodePair& p : edges) {
		m_edges.pushBack(p);
	}
}

MaxPlanarEdgesConstraint::MaxPlanarEdgesConstraint(Master* master, int edgeBound)
	: Constraint(master, nullptr, CSense::Less, edgeBound, false, false, true) {
	m_graphCons = true;
}

MaxPlanarEdgesConstraint::~MaxPlanarEdgesConstraint() { }

double MaxPlanarEdgesConstraint::coeff(const Variable* v) const {
	//TODO: speedup, we know between which nodepairs edges exist...
	if (m_graphCons) {
		return 1.0;
	}

	const EdgeVar* e = static_cast<const EdgeVar*>(v);
	for (const NodePair& p : m_edges) {
		if ((p.source == e->sourceNode() && p.target == e->targetNode())
				|| (p.source == e->targetNode() && p.target == e->sourceNode())) {
			return 1.0;
		}
	}
	return 0.0;
}
