diff --git a/9/9.iml b/9/9.iml
new file mode 100644
index 0000000000000000000000000000000000000000..d6ebd4805981b8400db3e3291c74a743fef9a824
--- /dev/null
+++ b/9/9.iml
@@ -0,0 +1,9 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$" />
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>
\ No newline at end of file
diff --git a/9/Homework b/9/Homework
new file mode 100644
index 0000000000000000000000000000000000000000..68eed079d5eee5b1ba3e838aef02b2399263333c
--- /dev/null
+++ b/9/Homework
@@ -0,0 +1,146 @@
+public class Homework {
+    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
diff --git a/9/misc.xml b/9/misc.xml
new file mode 100644
index 0000000000000000000000000000000000000000..e208459b8afde5f7980720efd6bbb97f7ae24541
--- /dev/null
+++ b/9/misc.xml
@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectRootManager" version="2" languageLevel="JDK_1_8" project-jdk-name="1.8" project-jdk-type="JavaSDK">
+    <output url="file://$PROJECT_DIR$/out" />
+  </component>
+</project>
\ No newline at end of file
diff --git a/9/modules.xml b/9/modules.xml
new file mode 100644
index 0000000000000000000000000000000000000000..03e1d581087161b66c13657c093f6b246dcb96ed
--- /dev/null
+++ b/9/modules.xml
@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectModuleManager">
+    <modules>
+      <module fileurl="file://$PROJECT_DIR$/.idea/9.iml" filepath="$PROJECT_DIR$/.idea/9.iml" />
+    </modules>
+  </component>
+</project>
\ No newline at end of file
diff --git a/9/vcs.xml b/9/vcs.xml
new file mode 100644
index 0000000000000000000000000000000000000000..35eb1ddfbbc029bcab630581847471d7f238ec53
--- /dev/null
+++ b/9/vcs.xml
@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="VcsDirectoryMappings">
+    <mapping directory="" vcs="Git" />
+  </component>
+</project>
\ No newline at end of file