A double-starlike tree is a graph with two stars (whose sizes need not be equal) jointed by a path.
两个大小不一定相等的星图由一条路连接而成的图叫做似双星树。
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.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
应用推荐