Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

#27

Open
funnycoderstar opened this issue Oct 1, 2018 · 0 comments
Open

#27

funnycoderstar opened this issue Oct 1, 2018 · 0 comments

Comments

@funnycoderstar
Copy link
Owner

funnycoderstar commented Oct 1, 2018

非线性数据结构-图

图的相关术语

一组由边连接的节点(或顶点);

一个图G=(V, E)

  • V: 一组顶点
  • E: 一组边, 连接V中的顶点

由一条边连接在一起的顶点称为相邻顶点;
一个顶点的度是其相邻顶点的数量;

  • 有向图和无向图
  • 未加权和加权的

图的表示

邻接矩阵

邻接表

关联矩阵

图的遍历

广度优先搜索(Breadth-First Search, BFS)

深度优先搜索(Depth-First Search, DFS)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant