递归实现DFS,BFS(纯代码)数组存图
摘要:递归版: BFS: void bfs(int i)//bfs可以参照层序遍历来写{ if (!visit2[i]) visit2[i...
阅读全文
posted @ 2021-05-30 20:04
posted @ 2021-05-30 20:04
posted @ 2021-05-27 20:32
posted @ 2021-05-22 16:01
posted @ 2021-05-19 21:09
posted @ 2021-05-07 22:05