[Function add]

Seanforfun · Seanforfun · commit 93793f978c36 · 2018-05-29T17:31:16.000-04:00
1.Add DFP
diff --git a/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DepthFirstPathDirectedGraph.java b/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DepthFirstPathDirectedGraph.java
@@ -0,0 +1,53 @@
+package ca.mcmaster.chapter.four.graph.directed;
+
+import java.io.File;
+import java.io.FileInputStream;
+import java.io.FileNotFoundException;
+
+import ca.mcmaster.chapter.four.graph.Path;
+import ca.mcmaster.chapter.one.bag.Bag;
+import ca.mcmaster.chapter.one.bag.ListBag;
+
+public class DepthFirstPathDirectedGraph implements Path {
+	private final DigraphImpl g;
+	private int s;
+	private final boolean[] marked;	//Used to mark if current vertex has been accessed.
+	private final int[] edgeTo;		//Used to save the vertex ahead of current vertex.
+	public DepthFirstPathDirectedGraph(DigraphImpl g, int s){
+		this.s = s;
+		this.g = (DigraphImpl) g;
+		marked = new boolean[g.V()];
+		edgeTo = new int[g.V()];
+		dfs(g, s);
+	}
+	public DepthFirstPathDirectedGraph(String file, int s) throws FileNotFoundException{
+		g = new DigraphImpl(new FileInputStream(new File(file)));
+		this.s = s;
+		marked = new boolean[g.V()];
+		edgeTo = new int[g.V()];
+		dfs(g, s);
+	}
+	@Override
+	public boolean hasPathTo(int v) {
+		return edgeTo[v] != 0;
+	}
+	@Override
+	public Iterable<Integer> pathTo(int v) {
+		Bag<Integer> path = new ListBag<Integer>();
+		path.add(v);
+		while(edgeTo[v] != s){
+			path.add(edgeTo[v]);
+			v = edgeTo[v];
+		}
+		return path;
+	}
+	private void dfs(DigraphImpl g, int v){
+		marked[v] = true;
+		for(int w : g.adj(v)){
+			if(!marked[w]){
+				edgeTo[w] = v;
+				dfs(g, w);
+			}
+		}
+	}
+}
diff --git a/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/Digraph.java b/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/Digraph.java
@@ -1,4 +1,4 @@
-package ca.mcmaster.chapter.four.graph;
+package ca.mcmaster.chapter.four.graph.directed;
 
 public interface Digraph {
 	/**
diff --git a/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DigraphImpl.java b/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DigraphImpl.java
@@ -1,4 +1,4 @@
-package ca.mcmaster.chapter.four.graph;
+package ca.mcmaster.chapter.four.graph.directed;
 
 import java.io.File;
 import java.io.FileInputStream;
diff --git a/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DirectedDFS.java b/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DirectedDFS.java
@@ -1,4 +1,4 @@
-package ca.mcmaster.chapter.four.graph;
+package ca.mcmaster.chapter.four.graph.directed;
 
 import java.io.File;
 import java.io.FileInputStream;
diff --git a/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/AbstractCC.java b/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/AbstractCC.java
@@ -1,4 +1,6 @@
-package ca.mcmaster.chapter.four.graph;
+package ca.mcmaster.chapter.four.graph.undirected;
+
+import ca.mcmaster.chapter.four.graph.Graph;
 
 public abstract class AbstractCC implements ConnectionComponent {
 	protected final Graph g;
diff --git a/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/AbstractPath.java b/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/AbstractPath.java
@@ -1,4 +1,7 @@
-package ca.mcmaster.chapter.four.graph;
+package ca.mcmaster.chapter.four.graph.undirected;
+
+import ca.mcmaster.chapter.four.graph.Graph;
+import ca.mcmaster.chapter.four.graph.Path;
 
 public abstract class AbstractPath implements Path {
 	protected final Graph g;
diff --git a/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/AbstractSearch.java b/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/AbstractSearch.java
@@ -1,4 +1,6 @@
-package ca.mcmaster.chapter.four.graph;
+package ca.mcmaster.chapter.four.graph.undirected;
+
+import ca.mcmaster.chapter.four.graph.Graph;
 
 public abstract class AbstractSearch implements Search {
 	protected final Graph g;
diff --git a/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/BreadthFirstPath.java b/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/BreadthFirstPath.java
@@ -1,10 +1,12 @@
-package ca.mcmaster.chapter.four.graph;
+package ca.mcmaster.chapter.four.graph.undirected;
 
 import java.io.File;
 import java.io.FileInputStream;
 import java.io.FileNotFoundException;
 import java.util.concurrent.LinkedBlockingQueue;
 
+import ca.mcmaster.chapter.four.graph.Graph;
+import ca.mcmaster.chapter.four.graph.Path;
 import ca.mcmaster.chapter.one.stack.ListStack;
 import ca.mcmaster.chapter.one.stack.MyStack;
 
diff --git a/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/ConnectionComponent.java b/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/ConnectionComponent.java
@@ -1,4 +1,4 @@
-package ca.mcmaster.chapter.four.graph;
+package ca.mcmaster.chapter.four.graph.undirected;
 
 public interface ConnectionComponent {
 	/**
diff --git a/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/DFSCC.java b/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/DFSCC.java
@@ -1,9 +1,10 @@
-package ca.mcmaster.chapter.four.graph;
+package ca.mcmaster.chapter.four.graph.undirected;
 
 import java.io.File;
 import java.io.FileInputStream;
 import java.io.FileNotFoundException;
 
+import ca.mcmaster.chapter.four.graph.Graph;
 import ca.mcmaster.chapter.one.bag.Bag;
 import ca.mcmaster.chapter.one.bag.ListBag;
 
diff --git a/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/DeepFirstSearch.java b/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/DeepFirstSearch.java
@@ -1,9 +1,11 @@
-package ca.mcmaster.chapter.four.graph;
+package ca.mcmaster.chapter.four.graph.undirected;
 
 import java.io.File;
 import java.io.FileInputStream;
 import java.io.FileNotFoundException;
 
+import ca.mcmaster.chapter.four.graph.Graph;
+
 public class DeepFirstSearch extends AbstractSearch {
 	private boolean[] marked;
 	private int count;
diff --git a/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/DepthFirstPath.java b/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/DepthFirstPath.java
@@ -1,9 +1,11 @@
-package ca.mcmaster.chapter.four.graph;
+package ca.mcmaster.chapter.four.graph.undirected;
 
 import java.io.File;
 import java.io.FileInputStream;
 import java.io.FileNotFoundException;
 
+import ca.mcmaster.chapter.four.graph.Graph;
+import ca.mcmaster.chapter.four.graph.Path;
 import ca.mcmaster.chapter.one.stack.ListStack;
 import ca.mcmaster.chapter.one.stack.MyStack;
 
diff --git a/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/Search.java b/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/Search.java
@@ -1,4 +1,4 @@
-package ca.mcmaster.chapter.four.graph;
+package ca.mcmaster.chapter.four.graph.undirected;
 
 public interface Search {
 	/**
diff --git a/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/SymbolGraph.java b/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/SymbolGraph.java
@@ -1,4 +1,6 @@
-package ca.mcmaster.chapter.four.graph;
+package ca.mcmaster.chapter.four.graph.undirected;
+
+import ca.mcmaster.chapter.four.graph.Graph;
 
 public interface SymbolGraph {
 	/**
diff --git a/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/SymbolGraphImpl.java b/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/SymbolGraphImpl.java
@@ -1,11 +1,13 @@
-package ca.mcmaster.chapter.four.graph;
+package ca.mcmaster.chapter.four.graph.undirected;
 
 import java.io.File;
 import java.io.FileNotFoundException;
 import java.util.HashMap;
 import java.util.Map;
 import java.util.Scanner;
 
+import ca.mcmaster.chapter.four.graph.Graph;
+
 public class SymbolGraphImpl implements SymbolGraph {
 	private final Map<String, Integer> st;
 	private String[] keys;
diff --git a/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/UFSearch.java b/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/UFSearch.java
@@ -1,9 +1,11 @@
-package ca.mcmaster.chapter.four.graph;
+package ca.mcmaster.chapter.four.graph.undirected;
 
 import java.io.File;
 import java.io.FileInputStream;
 import java.io.FileNotFoundException;
 
+import ca.mcmaster.chapter.four.graph.Graph;
+
 public class UFSearch extends AbstractSearch {
 	private final UF uf;
 	public UFSearch(Graph g, int s) {
diff --git a/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/UndirectedGraph.java b/Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/UndirectedGraph.java
@@ -1,8 +1,9 @@
-package ca.mcmaster.chapter.four.graph;
+package ca.mcmaster.chapter.four.graph.undirected;
 
 import java.io.FileInputStream;
 import java.util.Scanner;
 
+import ca.mcmaster.chapter.four.graph.Graph;
 import ca.mcmaster.chapter.one.bag.Bag;
 import ca.mcmaster.chapter.one.bag.ListBag;
 
diff --git a/DataStructrue/Graph/DepthFirstPathDirectedGraph.java b/DataStructrue/Graph/DepthFirstPathDirectedGraph.java
@@ -0,0 +1,53 @@
+package ca.mcmaster.chapter.four.graph.directed;
+
+import java.io.File;
+import java.io.FileInputStream;
+import java.io.FileNotFoundException;
+
+import ca.mcmaster.chapter.four.graph.Path;
+import ca.mcmaster.chapter.one.bag.Bag;
+import ca.mcmaster.chapter.one.bag.ListBag;
+
+public class DepthFirstPathDirectedGraph implements Path {
+	private final DigraphImpl g;
+	private int s;
+	private final boolean[] marked;	//Used to mark if current vertex has been accessed.
+	private final int[] edgeTo;		//Used to save the vertex ahead of current vertex.
+	public DepthFirstPathDirectedGraph(DigraphImpl g, int s){
+		this.s = s;
+		this.g = (DigraphImpl) g;
+		marked = new boolean[g.V()];
+		edgeTo = new int[g.V()];
+		dfs(g, s);
+	}
+	public DepthFirstPathDirectedGraph(String file, int s) throws FileNotFoundException{
+		g = new DigraphImpl(new FileInputStream(new File(file)));
+		this.s = s;
+		marked = new boolean[g.V()];
+		edgeTo = new int[g.V()];
+		dfs(g, s);
+	}
+	@Override
+	public boolean hasPathTo(int v) {
+		return edgeTo[v] != 0;
+	}
+	@Override
+	public Iterable<Integer> pathTo(int v) {
+		Bag<Integer> path = new ListBag<Integer>();
+		path.add(v);
+		while(edgeTo[v] != s){
+			path.add(edgeTo[v]);
+			v = edgeTo[v];
+		}
+		return path;
+	}
+	private void dfs(DigraphImpl g, int v){
+		marked[v] = true;
+		for(int w : g.adj(v)){
+			if(!marked[w]){
+				edgeTo[w] = v;
+				dfs(g, w);
+			}
+		}
+	}
+}
diff --git a/DataStructrue/Graph/DirectedGraph.md b/DataStructrue/Graph/DirectedGraph.md
@@ -136,6 +136,7 @@ public class DigraphImpl implements Digraph {
 >12: 9|
 
 ### 有向图的可达性
+>可达性的重要实际应用是在内存管理系统中，一个顶点表示一个对象，一条边表示一个对象的引用。
 ```Java
 public class DirectedDFS {
 	private final boolean[] marked;
@@ -175,3 +176,51 @@ public static void main(String[] args) throws FileNotFoundException {
 	}
 ```
 > 0 1 2 3 4 5 6 8 9 10 11 12
+
+### 单点有向路径
+>通过DFPath实现
+```Java
+public class DepthFirstPathDirectedGraph implements Path {
+	private final DigraphImpl g;
+	private int s;
+	private final boolean[] marked;	//Used to mark if current vertex has been accessed.
+	private final int[] edgeTo;		//Used to save the vertex ahead of current vertex.
+	public DepthFirstPathDirectedGraph(DigraphImpl g, int s){
+		this.s = s;
+		this.g = (DigraphImpl) g;
+		marked = new boolean[g.V()];
+		edgeTo = new int[g.V()];
+		dfs(g, s);
+	}
+	public DepthFirstPathDirectedGraph(String file, int s) throws FileNotFoundException{
+		g = new DigraphImpl(new FileInputStream(new File(file)));
+		this.s = s;
+		marked = new boolean[g.V()];
+		edgeTo = new int[g.V()];
+		dfs(g, s);
+	}
+	@Override
+	public boolean hasPathTo(int v) {
+		return edgeTo[v] != 0;
+	}
+	@Override
+	public Iterable<Integer> pathTo(int v) {
+		Bag<Integer> path = new ListBag<Integer>();
+		path.add(v);
+		while(edgeTo[v] != s){
+			path.add(edgeTo[v]);
+			v = edgeTo[v];
+		}
+		return path;
+	}
+	private void dfs(DigraphImpl g, int v){
+		marked[v] = true;
+		for(int w : g.adj(v)){
+			if(!marked[w]){
+				edgeTo[w] = v;
+				dfs(g, w);
+			}
+		}
+	}
+}
+```

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package ca.mcmaster.chapter.four.graph;`
	`1`	`+package ca.mcmaster.chapter.four.graph.directed;`
`2`	`2`
`3`	`3`	`public interface Digraph {`
`4`	`4`	`/**`