algorithms-for-computing-li.../src/main/java/Model/Arrangement.java

62 lines
1.3 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<Model.Coordinates> nodes;
private LinkedList<Model.Coordinates> lines;
public Arrangement(){
nodes = new LinkedList<>();
lines = new LinkedList<>();
}
public void addNode(Model.Coordinates node){
this.nodes.add(node);
}
public void removeNode(int index){
this.nodes.remove(index);
}
public void removeNode(Model.Coordinates node){
this.nodes.remove(node);
}
public void addLine(Model.Coordinates line){
this.lines.add(line);
}
public void removeLine(int index){
this.lines.remove(index);
}
public void removeLine(Model.Coordinates line){
this.lines.remove(line);
}
public LinkedList<Model.Coordinates> getNodes() {
return nodes;
}
public void setNodes(LinkedList<Model.Coordinates> nodes) {
this.nodes = nodes;
}
public LinkedList<Model.Coordinates> getLines() {
return lines;
}
public void setLines(LinkedList<Model.Coordinates> lines) {
this.lines = lines;
}
}