AIHHU / dfs-and-bfs-of-graph Public

Notifications You must be signed in to change notification settings
Fork 1
Star 3

图的遍历，广度优先与深度优先，邻接表实现

3 stars 1 fork Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
README.md		README.md
graph.c		graph.c

Repository files navigation

dfs-and-bfs-of-graph

图的遍历，广度优先与深度优先，邻接表实现

也许是个巧合？除了这两个算法之外，好像用邻接表实现的算法开销都是O(n+e)？

About

图的遍历，广度优先与深度优先，邻接表实现

Report repository

Releases

No releases published

Packages

No packages published

Languages

C 100.0%