com.github.fanavarro.graphlib.algorithms.subtree.SubtreeInput Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of graphlib Show documentation

Java library for graph management.

There is a newer version: 0.0.5

package com.github.fanavarro.graphlib.algorithms.subtree;

import java.util.Set;

import org.apache.commons.lang3.builder.EqualsBuilder;
import org.apache.commons.lang3.builder.HashCodeBuilder;

import com.github.fanavarro.graphlib.Graph;
import com.github.fanavarro.graphlib.algorithms.AlgorithmInput;

/**
 * The Class SubtreeInput.
 *
 * @param 
 *            the node type
 * @param 
 *            the edge type
 */
public class SubtreeInput implements AlgorithmInput {

	/** The graph. */
	private Graph graph;

	/** The nodes to be contained. */
	private Set nodesToBeContained;

	/*
	 * (non-Javadoc)
	 *
	 * @see es.um.dis.graphlib.algorithms.AlgorithmInput#getGraph()
	 */
	@Override
	public Graph getGraph() {
		return graph;
	}

	/*
	 * (non-Javadoc)
	 *
	 * @see
	 * es.um.dis.graphlib.algorithms.AlgorithmInput#setGraph(es.um.dis.graphlib.
	 * Graph)
	 */
	@Override
	public void setGraph(Graph graph) {
		this.graph = graph;
	}

	/**
	 * Gets the nodes to be contained.
	 *
	 * @return the nodes to be contained
	 */
	public Set getNodesToBeContained() {
		return nodesToBeContained;
	}

	/**
	 * Sets the nodes to be contained.
	 *
	 * @param nodesToBeContained
	 *            the new nodes to be contained
	 */
	public void setNodesToBeContained(Set nodesToBeContained) {
		this.nodesToBeContained = nodesToBeContained;
	}

	/*
	 * (non-Javadoc)
	 *
	 * @see java.lang.Object#toString()
	 */
	@Override
	public String toString() {
		StringBuilder builder = new StringBuilder();
		builder.append("SubtreeInput [graph=");
		builder.append(graph);
		builder.append(", nodesToBeContained=");
		builder.append(nodesToBeContained);
		builder.append("]");
		return builder.toString();
	}

	/**
	 * {@inheritDoc}
	 */
	@Override
	public boolean equals(final Object other) {
		if (this == other) {
			return true;
		}
		if (!(other instanceof SubtreeInput)) {
			return false;
		}
		SubtreeInput castOther = (SubtreeInput) other;
		return new EqualsBuilder().append(graph, castOther.graph)
				.append(nodesToBeContained, castOther.nodesToBeContained).isEquals();
	}

	/**
	 * {@inheritDoc}
	 */
	@Override
	public int hashCode() {
		return new HashCodeBuilder().append(graph).append(nodesToBeContained).toHashCode();
	}

}