摘要:
// 深搜 private void dfs(int v) { visited[v] = true; System.out.print(v+" "); for (int i = 0; i que = new LinkedList(); que.offer(v); while (!que.isEmpty()) { v = que.poll(); System.out.print(v+" "); visited[v] = true; //将被访问节点的分支节点(邻接点)加入到队列中 ... 阅读全文
posted @ 2014-02-22 14:21
happinessqi
阅读(600)
评论(0)
推荐(0)