更改

The incidence matrix of a directed graph is a  matrix B where n and m are the number of vertices and edges respectively, such that  if the edge e_j leaves vertex v_i, 1 if it enters vertex v_i and 0 otherwise (many authors use the opposite sign convention).

The incidence matrix of a directed graph is a  matrix B where n and m are the number of vertices and edges respectively, such that  if the edge e_j leaves vertex v_i, 1 if it enters vertex v_i and 0 otherwise (many authors use the opposite sign convention).

'''<font color="#32CD32">有向图的关联矩阵是一个矩阵''B''，其中''n'' 和''m''分别是顶点和边的数目，这样如果边 e_j 离开顶点 v_i，为1，如果它进入顶点 v_i ，为0(许多作者使用相反的符号约定)。</font>The incidence matrix of a directed graph is a  matrix B where n and m are the number of vertices and edges respectively, such that  if the edge e_j leaves vertex v_i, 1 if it enters vertex v_i and 0 otherwise (many authors use the opposite sign convention).

'''<font color="#32CD32">有向图的关联矩阵是一个矩阵''B''，其中 ''n'' 和 ''m'' 分别是顶点和边的数目，这样如果边 e_j 离开顶点 v_i，为1，如果它进入顶点 v_i ，为0(许多作者使用相反的符号约定)。</font>The incidence matrix of a directed graph is a  matrix B where n and m are the number of vertices and edges respectively, such that  if the edge e_j leaves vertex v_i, 1 if it enters vertex v_i and 0 otherwise (many authors use the opposite sign convention).