konzeptionelle reorga: als basis fuer die dropletsequenzberechnung dient nun...

konzeptionelle reorga: als basis fuer die dropletsequenzberechnung dient nun eine tabelle mit bifurcations

src/BFTableEntry.java

+package nloc;
+
+public class BFTableEntry {
+  
+  private int minTimediff, maxTimediff;
+  private int noOfDroplets;
+  private int bfPathPriority;
+
+  public BFTableEntry(int bfPathPriority, int noOfDroplets, int minTimediff,
+      int maxTimediff) {
+    this.minTimediff = minTimediff;
+    this.maxTimediff = maxTimediff;
+    this.noOfDroplets = noOfDroplets;
+    this.bfPathPriority = bfPathPriority;
+  }
+
+  public int getMinTimediff() {
+    return minTimediff;
+  }
+  
+  public int getMaxTimediff() {
+    return maxTimediff;
+  }
+
+  public int getNoOfDroplets() {
+    return noOfDroplets;
+  }
+
+  public int getBfPathPriority() {
+    return bfPathPriority;
+  }
+
+  public void setMinTimediff(int minTimediff) {
+    this.minTimediff = minTimediff;
+  }
+
+  public void setMaxTimediff(int maxTimediff) {
+    this.maxTimediff = maxTimediff;
+  }
+
+  public void setNoOfDroplets(int noOfDroplets) {
+    this.noOfDroplets = noOfDroplets;
+  }
+
+  public void setBfPathPriority(int bfPathPriority) {
+    this.bfPathPriority = bfPathPriority;
+  }
+}