From 3f9856709d092e8bb2eb125b49a87dfe4cc30a78 Mon Sep 17 00:00:00 2001
From: stefanzan <stefanzan@163.com>
Date: Wed, 30 Dec 2020 10:52:18 +0800
Subject: [PATCH 1/2] update README.md.

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index c7dc5aa..7c746b8 100644
--- a/README.md
+++ b/README.md
@@ -6,7 +6,7 @@
 
 ### 截止日期
 
-2021.1.6
+2021.1.13
 
 ### 基础
 
-- 
Gitee


From 8d58636cc187e0cfb0bf14f2eb37cb6d6d392649 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E9=83=91=E6=97=AD=E7=83=9C?= <942457217@qq.com>
Date: Thu, 7 Jan 2021 10:14:34 +0800
Subject: [PATCH 2/2] =?UTF-8?q?=E5=9B=BE?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 "\350\257\276\344\273\266/hwork" | 146 +++++++++++++++++++++++++++++++
 1 file changed, 146 insertions(+)
 create mode 100644 "\350\257\276\344\273\266/hwork"

diff --git "a/\350\257\276\344\273\266/hwork" "b/\350\257\276\344\273\266/hwork"
new file mode 100644
index 0000000..03e8516
--- /dev/null
+++ "b/\350\257\276\344\273\266/hwork"
@@ -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--;
+    }
+}
-- 
Gitee