Algorithm to compute term rank of a matrix based on the construction a bipartite graph

We consider method to compute term rank of a matrix based on the construction a bipartite graph. The term rank of a matrix
$A$
is defined to be the minimum number of rows and columns that contain all non-zero elements of the matrix. In this article, we will discuss the Ford-Fulkerson algorithm for the maximum flow problem. Next, we propose modeling the algorithm in the MATLAB environment. The application of this algorithm for evaluating the characteristics of codes in a term-rank metric is considered.