/** \file
 * \brief Auxiliary data structure for (node,int) pair.
 *
 * \author Stefan Hachul
 *
 * \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/basic/Graph.h>

#include <istream>

namespace ogdf {
namespace energybased {
namespace fmmm {

//! Data structure for representing nodes and an int value (needed for class ogdf/list)
//! to perform bucket sort.
class Node {
	friend int value(const Node& A) { return A.value; }

	friend std::ostream& operator<<(std::ostream& output, const Node& A) {
		output << "node index ";
		if (A.vertex == nullptr) {
			output << "nil";
		} else {
			output << A.vertex->index();
		}
		output << " value " << A.value;
		return output;
	}

	friend std::istream& operator>>(std::istream& input, Node& A) {
		input >> A.value;
		return input;
	}

public:
	//! Constructor
	Node() {
		vertex = nullptr;
		value = 0;
	}

	void set_Node(node v, int a) {
		vertex = v;
		value = a;
	}

	int get_value() const { return value; }

	node get_node() const { return vertex; }

private:
	node vertex;
	int value;
};

}
}
}
