We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
非线性数据结构-图
一组由边连接的节点(或顶点);
一个图G=(V, E)
由一条边连接在一起的顶点称为相邻顶点; 一个顶点的度是其相邻顶点的数量;
The text was updated successfully, but these errors were encountered:
No branches or pull requests
图的相关术语
一组由边连接的节点(或顶点);
一个图G=(V, E)
由一条边连接在一起的顶点称为相邻顶点;
一个顶点的度是其相邻顶点的数量;
图的表示
邻接矩阵
邻接表
关联矩阵
图的遍历
广度优先搜索(Breadth-First Search, BFS)
深度优先搜索(Depth-First Search, DFS)
The text was updated successfully, but these errors were encountered: