为了便于计算机处理，将有向图用矩阵表示，通过有向图矩阵的乘法运算搜索最长的有向路径。

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.

youdao

为了便于计算机处理，将有向图用矩阵表示，通过有向图矩阵的乘法运算搜索最长的有向路径。

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.

youdao