/*
Copyright 2008-2010 Gephi
Authors : Mathieu Bastian <mathieu.bastian@gephi.org>
Website : http://www.gephi.org
This file is part of Gephi.
Gephi 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.
Gephi 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 Gephi. If not, see <http://www.gnu.org/licenses/>.
*/
package org.gephi.ranking.impl;
import org.gephi.graph.api.Graph;
import org.gephi.ranking.api.Ranking;
/**
*
* @author Mathieu Bastian
*/
public abstract class AbstractRanking<Element, Type extends Number> implements Ranking<Element, Type> {
protected double hash;
protected Type minimum;
protected Type maximum;
protected Graph graph;
public Type getMinimumValue() {
return minimum;
}
public Type getMaximumValue() {
return maximum;
}
public void setMinimumValue(Type value) {
this.minimum = value;
}
public void setMaximumValue(Type value) {
this.maximum = value;
}
public Graph getGraph() {
return graph;
}
public void setGraph(Graph graph) {
this.graph = graph;
}
}