numer of droplets wird schon generiert

src/Channel.java

@@ -3,6 +3,7 @@ import java.util.ArrayList;
 import java.util.List;
 import java.util.SortedSet;
 import java.util.TreeSet;
+import java.util.Arrays;
 
 public class Channel extends NlocEntity implements Comparable<Channel> {
   private int pSteps, hSteps;
@@ -40,8 +41,8 @@ public class Channel extends NlocEntity implements Comparable<Channel> {
     }
   }
 
-  public SortedSet<Channel> getChildren() {
-    return children;
+  public List<Channel> getChildrenList() {
+    return Arrays.asList(children.toArray(new Channel[0]));
   }
 
   public List<Channel> getParents() {

src/Nloc.java

@@ -2,6 +2,7 @@ package nloc;
 
 import java.util.List;
 import java.util.ArrayList;
+import java.util.ListIterator;
 import java.util.Arrays;
 
 public class Nloc {
@@ -10,7 +11,7 @@ public class Nloc {
     List<Channel> chanlist = getNloc3();
     Channel p0 = chanlist.get(chanlist.size() - 2);
 
-    List<Channel> mod = getModulesByName(Arrays.asList("m2","m3"), chanlist);
+    List<Channel> mod = getModulesByName(Arrays.asList("m1","m2"), chanlist);
 
     List<List<Channel>> pathlist = getAllPaths(p0, new ArrayList<Channel>());
     printPaths(pathlist);
@@ -21,15 +22,29 @@ public class Nloc {
     if (desiredPath.size() == 0) {
       System.out.println("No such Path!");
     } else {
-      for (Channel ch : desiredPath) {
-        System.out.print("ID: " + ch.getID() + " ");
-      }
-      System.out.println("");
+      printPath(desiredPath);
     }
 
+    System.out.println("Number of Droplets needed: " + getNumberOfDroplets(desiredPath));
   }
 
   
+  public static int getNumberOfDroplets(List<Channel> desiredPath) {
+    int numOfDroplets = 1;
+    ListIterator<Channel> iter = desiredPath.listIterator();
+    while(iter.hasNext()) {
+      Channel current = iter.next();
+      if (current.isBifurcation()) {
+        numOfDroplets *= (current.getChildrenList().indexOf(iter.next()) + 1);
+        iter.previous();
+      }
+    }
+    return numOfDroplets;
+  }
+  //public static List<Droplet> generateDropletSequence(List<Channel> path) {
+
+  //}
+
   public static List<Channel> getDesiredPath(List<Channel> modules,
       List<List<Channel>> pathlist) {
     List<Channel> found = new ArrayList<Channel>();
@@ -54,13 +69,17 @@ public class Nloc {
     return ret;
   }
 
+  public static void printPath(List<Channel> path) {
+    for (Channel ch : path) {
+      System.out.print("ID: " + ch.getID() + " ");
+    }
+    System.out.println("");
+  }
+
   public static void printPaths(List<List<Channel>> pathlist) {
     System.out.println("Number of paths found: " + pathlist.size());
     for (List<Channel> p : pathlist) {
-      for (Channel ch : p) {
-        System.out.print("ID: " + ch.getID() + " ");
-      }
-      System.out.println("");
+      printPath(p);
     }
   }
 
@@ -72,10 +91,10 @@ public class Nloc {
 
   public static void getAllPathsRecursive(Channel chan, List<Channel> path, List<List<Channel>> pathlist) {
     path.add(chan);
-    if (chan.getChildren().size() == 0) { 
+    if (chan.getChildrenList().size() == 0) { 
       pathlist.add(path);
     } else {
-      for (Channel ch : chan.getChildren()) {
+      for (Channel ch : chan.getChildrenList()) {
         getAllPathsRecursive(ch, new ArrayList<Channel>(path), pathlist);
       }
     }