62 lines
1.2 KiB
Java
62 lines
1.2 KiB
Java
package Model;
|
|
|
|
import java.util.LinkedList;
|
|
|
|
/**
|
|
* Implementierung verschiedener Algorithmen zur Berechnung von Ausgleichsgeraden.
|
|
*
|
|
* @Author: Armin Wolf
|
|
* @Email: a_wolf28@uni-muenster.de
|
|
* @Date: 28.05.2017.
|
|
*/
|
|
public class Arrangement {
|
|
|
|
private LinkedList<Pair> nodes;
|
|
private LinkedList<Pair> lines;
|
|
|
|
public Arrangement(){
|
|
nodes = new LinkedList<>();
|
|
lines = new LinkedList<>();
|
|
}
|
|
|
|
public void addNode(Pair node){
|
|
this.nodes.add(node);
|
|
}
|
|
|
|
public void removeNode(int index){
|
|
this.nodes.remove(index);
|
|
}
|
|
|
|
public void removeNode(Pair node){
|
|
this.nodes.remove(node);
|
|
}
|
|
|
|
public void addLine(Pair line){
|
|
this.lines.add(line);
|
|
}
|
|
|
|
public void removeLine(int index){
|
|
this.lines.remove(index);
|
|
}
|
|
|
|
public void removeLine(Pair line){
|
|
this.lines.remove(line);
|
|
}
|
|
|
|
public LinkedList<Pair> getNodes() {
|
|
return nodes;
|
|
}
|
|
|
|
public void setNodes(LinkedList<Pair> nodes) {
|
|
this.nodes = nodes;
|
|
}
|
|
|
|
public LinkedList<Pair> getLines() {
|
|
return lines;
|
|
}
|
|
|
|
public void setLines(LinkedList<Pair> lines) {
|
|
this.lines = lines;
|
|
}
|
|
}
|