Alawn/Druid
1
0
Fork 0
mirror of https://github.com/alibaba/druid.git synced 2023-03-04 19:17:16 +00:00
Code Issues Releases Wiki Activity

removed main function. for issue #2117

Browse Source
This commit is contained in:
wenshao
2017-11-20 16:35:30 +08:00
parent 077ce62ab0
commit f6863f013b
1 changed files with 22 additions and 22 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/main/java/com/alibaba/druid/util/ListDG.java
+22 -22
View File
@@ -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(); // 拓扑排序
// }
}