commit

Author: 1367356

.metadata/.plugins/org.eclipse.core.resources/.history/17/203fd793dfa80017102fc75ae426c58e

@@ -0,0 +1,20 @@
+package maxflowMincutBak;
+
+import java.util.List;
+
+/**
+ * FordFulkerson 方法求最大流问题，每次从残存网路中找到一个最短距离和最小容量，知道最后最小容量为0，结束。
+ * @author liyafei
+ *
+ */
+public class FordFulkersonMethod {
+			DijkstraAlgorithm da=new DijkstraAlgorithm(100, 0);
+			int vertex=0,end=4;
+			public void fordFulkerson(){
+				List list=da.createGraph("/page425InAlgorithm");
+//				List list=da.createGraph("/page425InAlgorithm.txt");
+				List<List> list2=da.shortestPathOfBFS(vertex, end);
+				double d=da.minValueofPath( list2.get(end));
+				da.printShortestPathOfBFS(vertex, end);
+			}
+}

.metadata/.plugins/org.eclipse.core.resources/.history/9e/b0399a73dfa80017102fc75ae426c58e

@@ -0,0 +1,22 @@
+package maxflowMincutBak;
+
+import java.util.List;
+
+/**
+ * FordFulkerson 方法求最大流问题，每次从残存网路中找到一个最短距离和最小容量，知道最后最小容量为0，结束。
+ * @author liyafei
+ *
+ */
+public class FordFulkersonMethod {
+			DijkstraAlgorithm da=new DijkstraAlgorithm(100, 0);
+			int vertex=0,end=4;
+			public void fordFulkerson(){
+				List list=da.createGraph("/page425InAlgorithm");
+//				List list=da.createGraph("/page425InAlgorithm.txt");
+				List<List> list2=da.shortestPathOfBFS(vertex, end);
+				double d=da.minValueofPath( list2.get(end));
+				da.printShortestPathOfBFS(vertex, end);
+				
+				
+			}
+}