ConnectableNode.java

/**
 * This file is part of Relation Analyzer for OSM.
 * Copyright (c) 2001 by Adrian Stabiszewski, as@grundid.de
 *
 * Relation Analyzer is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Affero General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * Relation Analyzer 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 Affero General Public License for more details.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with Relation Analyzer.  If not, see <http://www.gnu.org/licenses/>.
 */
package org.osmtools.ra.analyzer;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Iterator;

import org.osmtools.ra.data.Node;

public class ConnectableNode {

	private Collection<Node> nodes;

	public ConnectableNode(Node... nodes) {
		this.nodes = Arrays.asList(nodes);
	}

	public ConnectableNode(Collection<Node> nodes) {
		this.nodes = new ArrayList<Node>(nodes);
	}

	/**
	 * Returns true, if this node can connect to the given node. This means that they have at least one common node.
	 * 
	 * @param node
	 * @return
	 */
	public boolean isConnectable(ConnectableNode node) {
		return !Collections.disjoint(nodes, node.nodes);
	}

	public boolean contains(Node node) {
		return nodes.contains(node);
	}

	public int size() {
		return nodes.size();
	}

	public Iterator<Node> getNodesIterator() {
		return nodes.iterator();
	}
}