diff --git a/README.md b/README.md
index c7dc5aa5bba1afbc05a618946e230510e5bfd2c2..7c746b86f53960d3119d671558e6b29633ff82a6 100644
--- a/README.md
+++ b/README.md
@@ -6,7 +6,7 @@
 
 ### 截止日期
 
-2021.1.6
+2021.1.13
 
 ### 基础
 
diff --git a/T.java b/T.java
new file mode 100644
index 0000000000000000000000000000000000000000..b6f4f538323eb954d4ea2ee103c20e6363058973
--- /dev/null
+++ b/T.java
@@ -0,0 +1,146 @@
+public class T {
+    private char[] mVexs;
+    private int[][] mMatrix;
+    public T(char[] vexs, char[][] edges){
+        int vlen=vexs.length;
+        int elen=edges.length;
+        mVexs=new char[vlen];
+        for(int i=0;i<vlen;i++){
+            mVexs[i]=vexs[i];
+        }
+        mMatrix=new int[vlen][vlen];
+        for(int i=0;i<elen;i++){
+
+            int pos1=getPos(edges[i][0]);
+            int pos2=getPos(edges[i][1]);
+            mMatrix[pos1][pos2]=1;
+        }
+    }
+    private int getPos(char c) {
+
+        for(int i=0;i<mVexs.length;i++){
+            if(mVexs[i]==c){
+                return i;
+            }
+        }return -1;
+    }
+
+    private int nextVertex(int i, int w) {
+        for(int j=w+1;j<mVexs.length;j++){
+            if(mMatrix[i][j]==1){
+                return j;
+            }
+        }return -1;
+
+    }
+
+    private int firstVertex(int i) {
+
+        for(int j=0;j<mVexs.length;j++){
+            if(mMatrix[i][j]==1){
+                return j;
+            }
+        }return -1;
+    }
+
+    public void print(){
+        for(int i=0;i<mMatrix.length;i++){
+            for(int j=0;j<mMatrix[i].length;j++){
+                System.out.print(mMatrix[i][j]+" ");
+            }
+            System.out.println();
+        }
+    }
+    public static void main(String[] args) {
+
+        char[] vexs = {'A', 'B', 'C', 'D','E','F','G','H','I'};
+        char[][] edges = new char[][]{
+                {'A', 'B'},
+                {'A', 'F'},
+                {'B', 'G'},
+                {'B', 'C'},
+                {'B', 'I'},
+                {'C', 'B'},
+                {'C', 'I'},
+                {'C', 'D'},
+                {'D', 'C'},
+                {'D', 'I'},
+                {'D', 'G'},
+                {'D', 'H'},
+                {'D', 'E'},
+                {'E', 'H'},
+                {'E', 'F'},
+                {'F', 'G'},
+                {'F', 'A'},
+                {'F', 'E'},
+                {'G', 'H'},
+                {'G', 'D'},
+                {'G', 'B'},
+                {'H', 'G'},
+                {'H', 'D'},
+                {'H', 'E'},
+                {'I', 'B'},
+                {'I', 'C'}
+
+        };
+        T pG;
+        pG = new T(vexs, edges);
+        pG.print();
+        pG.DFS();
+        pG.BFS();
+    }
+    private void BFS() {
+        int head=0;
+        int rear=0;
+        int[] queue=new int[this.mVexs.length];
+        boolean[] visited=new boolean[this.mVexs.length];
+        for (int i = 0; i < mVexs.length; i++){
+            visited[i] = false;
+        }
+        System.out.println("BFS:");
+        for(int i=0;i<mVexs.length;i++){
+            if(visited[i]==false){
+                visited[i]=true;
+                System.out.print(" "+mVexs[i]);
+                queue[rear++]=i;
+            }
+            while(head!=rear){
+                int j=queue[head++];
+                int k=firstVertex(j);
+                while(k>=0){
+                    if(visited[k]==false){
+                        visited[k]=true;
+                        System.out.print(" "+mVexs[k]);
+                        queue[rear++]=k;
+                    }
+                    k=nextVertex(j,k);
+                }
+            }
+        }
+
+
+    }
+    private void DFS() {
+        boolean[] visited=new boolean[mVexs.length];
+        System.out.println("DFS:");
+        for(int i=0;i<mVexs.length;i++){
+            if(visited[i]==false){
+                DFS(i,visited);
+            }
+        }
+        System.out.println();
+
+    }
+    private void DFS(int i, boolean[] visited) {
+        visited[i]=true;
+        System.out.print(" "+mVexs[i]);
+        int w=firstVertex(i);//i:A,w:B
+        while(w>=0){
+            if(visited[w]==false){
+                DFS(w,visited);
+            }
+            w=nextVertex(i,w);
+        }
+        i--;
+    }
+}
\ No newline at end of file