cycle in directed graph 在有向图形中的回路
Not only can a single rainfall process but also erosion and hydrological process in a certain time of cycle be analyzed, the results can be printed in figure, graph or curve.
模型既可对单一的降雨过程进行分析，也可对一定时间周期内的侵蚀和水文过程进行分析，并且可用数据、图形和曲线等形式输出运行结果。
This paper discusses the application of degree in other aspects of graph theory, such as cycle, Hamiltonian graph and matching on the base of reference.
在已有文献的基础上，讨论度在图论其它方面，诸如在圈、哈密顿图、匹配中的应用。
In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g.
给定一个无向连通图g，圈包装问题就是求g的边不相交圈的最大数目。
应用推荐