摘要
图的遍历方式有深度与广度两种,既适合于无向图,也适合于有向图。通过具体示例,详细分析以邻接矩阵为存储结构图的广度优先搜索遍历算法,并在机器上实现完整的程序。
Graph has two traversing methods of breadth-first and depth-first, but they are suitable both for digraph and undigraph. Breadth-first search traversing algorithm of a graph was analyzed in details, which stored in adjacency matrix. And the complete programs were run on computer.
出处
《农业网络信息》
2009年第12期136-137,共2页
Agriculture Network Information
关键词
图的邻接矩阵存储
遍历
广度优先搜索
adjacency matrix storage of graph
traversing
breadth-first search
