For computer processing of the directed digraph, it is expressed by a matrix, and then the longest directed paths can be obtained through matrices multiplication.
为了便于计算机处理，将有向图用矩阵表示，通过有向图矩阵的乘法运算搜索最长的有向路径。
By using Boolean matrix, some results of power convergence exponent of line digraph are given.
采用布尔矩阵，得到了线有向幂敛指数的一些结果。
By using the matrix representation of a digraph, some results about the index of convergence and period of a line digraph are obtained.
采用有向图的矩阵表示，得到了线有向图的幂敛指数和周期的有关结果。
On the basis of the discussions, an algorithm for finding all directed circuits from walk matrix of digraph is presented.
由此提出一个生成有向图的全部有向回路的算法。
On the basis of the discussions, an algorithm for finding all directed circuits from walk matrix of digraph is presented.
由此提出一个生成有向图的全部有向回路的算法。
应用推荐