对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
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.
结合图论理论和电网的特点，实现了一种基于元件邻接关系和广度优先搜索算法的网络拓扑分析方法。
A topology analysis method based on adjacent relation of elements in the network and Breadth first search is realized combined with Graph theory and the characteristics of power grid.
还提出了一种基于节点邻接矩阵的快速可观测性分析方法。
In addition a speedy observability analysis method based on nodal adjacent matrix is put forward.
应用推荐