This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
From the top level data object contained in the graph, all children data objects are reachable by traversing the references from the root data object.
对于包含在数据图中的顶层数据对象，可以从根数据对象开始遍历引用来到达所有子数据对象。
Additionally common graph based algorithms like path-searches are easy to implement by traversing through the graph.
另外，基于如路径-查询(Path - Search)算法的普通图，也易于通过遍历图来实现。
应用推荐