The minimal path is illustrated for each matrix.

两个矩阵的最短路径如图所示。

youdao

Matrix arithmetic of network maximal flux and minimal separate set not only solves these problems, but also solves some other problems by the computer such as minimal fee, distribution and transport.

网络最大流与最小割集的矩阵算法，不仅能解决许多这类问题，而且能使最小费用流、分配问题和运输问题容易通过计算机来实现。

youdao

By the convergence of the method, we can fast construct a COSTBC matrix with the maximal rates and the minimal decoding delays that we all know now recur to the computer.

利用该方法良好的收敛性，可以借助于电子计算机快速的构造目前已知的具有最大码率和最小解码时延的多天线复正交空时分组编码矩阵。

youdao