1) regular directed graphs
有向正则图
2) regular directed graph
正则有向图
3) weakly regular digraph
弱正则有向图
1.
In this paper we obtain techniques for computing the characteristic polynomials of ordinary digraphs graph theory and determining relations of characteristic polynomials about weakly regular digraph and its complement.
本文解决了一般有向图的特征多项式的图论计算方法 ,并且给出了弱正则有向图和它的补图之间特征多项式的关系 ,从而也就解决了非负整数方阵特征多项式的图论计算方法问题 。
4) thin weakly distance-regular diagraphs
非弱距离正则有向图
5) weakly distance-regular digraph
弱距离正则有向图
1.
The lexicographic product Γ′=Γ from Γ to C*r is constructed and the equivalent conditions for it being a weakly distance-regular digraphs is given.
构作了从Γ到Cr*的字典式积图Γ′=Γ[Cr*],给出了Γ′=Γ[Cr*]是弱距离正则有向图的充要条件。
2.
In this paper , we discuss the constructions of lexicographic product and directed product from weakly distance-regular digraphs to undirected graphs, and of lexicographic product from a digraph to a digraph.
本文讨论由弱距离正则有向图到无向图的字典式积、直积及两个有向图字典式积的构作,给出了它们是弱距离正则有向图的等价条件。
6) positive weight direction graph
正权有向图
1.
Base on Single-Source Shortest-Paths Problem, about function we improve Dijkstra algorithm work at positive weight direction graph.
介绍了基于单源点最短路径问题在假定正权有向图上工作的Dijkstra算法以及算法的时间复杂度,同时又介绍了作了功能改进后的Dijkstra算法以及时间复杂度分析,并给出了算法实际工作于不含负长度环有向图的过程和结果。
补充资料：凡事豫则立，不豫则废
1.谓做任何事情，事先谋虑准备就会成功，否则就要失败。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条