1)Traversal of graph.2)2 ways: DFS(深度优先搜索) and BFS (广度优先搜索）.
UI利用Qt制作
算法部分基础为Rober Sedgewick与Kevin Wayne所著的《算法第4版》中的图的Java代码，后面参考了windyear用户的C++改造源码。
最终写出这种小程序。
-
Notifications
You must be signed in to change notification settings - Fork 4
1)Traversal of graph.2)2 ways: DFS(深度优先搜索) and BFS (广度优先搜索）.
License
Tomlk/Graph_DFS_BFS
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
1)Traversal of graph.2)2 ways: DFS(深度优先搜索) and BFS (广度优先搜索）.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published