From f6863f013b91917b8c4ff45610b7b07b8f14a700 Mon Sep 17 00:00:00 2001
From: wenshao <szujobs@hotmail.com>
Date: Mon, 20 Nov 2017 16:35:30 +0800
Subject: [PATCH] removed main function. for issue #2117

---
 .../java/com/alibaba/druid/util/ListDG.java   | 44 +++++++++----------
 1 file changed, 22 insertions(+), 22 deletions(-)

diff --git a/src/main/java/com/alibaba/druid/util/ListDG.java b/src/main/java/com/alibaba/druid/util/ListDG.java
index bac07df8b6..ed526483fc 100644
--- a/src/main/java/com/alibaba/druid/util/ListDG.java
+++ b/src/main/java/com/alibaba/druid/util/ListDG.java
@@ -259,26 +259,26 @@ public class ListDG {
         return true;
     }
 
-    public static void main(String[] args) {
-        Object[] vexs = {'A', 'B', 'C', 'D', 'E', 'F', 'G'};
-        Edge[] edges = new Edge[]{
-                new Edge(vexs[0], vexs[6]),
-                new Edge(vexs[1], vexs[0]),
-                new Edge(vexs[1], vexs[3]),
-                new Edge(vexs[2], vexs[5]),
-                new Edge(vexs[2], vexs[6]),
-                new Edge(vexs[3], vexs[4]),
-                new Edge(vexs[3], vexs[5])};
-        ListDG pG;
-
-        // 自定义"图"(输入矩阵队列)
-        //pG = new ListDG();
-        // 采用已有的"图"
-        pG = new ListDG(Arrays.asList(vexs), Arrays.asList(edges));
-
-        pG.print();   // 打印图
-        //pG.DFS();     // 深度优先遍历
-        //pG.BFS();     // 广度优先遍历
-        pG.topologicalSort();     // 拓扑排序
-    }
+//    public static void main(String[] args) {
+//        Object[] vexs = {'A', 'B', 'C', 'D', 'E', 'F', 'G'};
+//        Edge[] edges = new Edge[]{
+//                new Edge(vexs[0], vexs[6]),
+//                new Edge(vexs[1], vexs[0]),
+//                new Edge(vexs[1], vexs[3]),
+//                new Edge(vexs[2], vexs[5]),
+//                new Edge(vexs[2], vexs[6]),
+//                new Edge(vexs[3], vexs[4]),
+//                new Edge(vexs[3], vexs[5])};
+//        ListDG pG;
+//
+//        // 自定义"图"(输入矩阵队列)
+//        //pG = new ListDG();
+//        // 采用已有的"图"
+//        pG = new ListDG(Arrays.asList(vexs), Arrays.asList(edges));
+//
+//        pG.print();   // 打印图
+//        //pG.DFS();     // 深度优先遍历
+//        //pG.BFS();     // 广度优先遍历
+//        pG.topologicalSort();     // 拓扑排序
+//    }
 }
\ No newline at end of file