526
个编辑
更改
跳到导航
跳到搜索
第239行：
第239行： − +
→Undirected and directed graphs 无向图和有向图
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<sub>j</sub> leaves vertex v<sub>i</sub>, 1 if it enters vertex v<sub>i</sub> 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<sub>j</sub> leaves vertex v<sub>i</sub>, 1 if it enters vertex v<sub>i</sub> and 0 otherwise (many authors use the opposite sign convention).
'''<font color="#32CD32">有向图的关联矩阵是一个矩阵''B''，其中 ''n'' 和 ''m'' 分别是顶点和边的数目，这样当边 e<sub>j</sub> 离开顶点 v<sub>i</sub>，时为1，当它进入顶点 v<sub>i</sub> ，时为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<sub>j</sub> leaves vertex v<sub>i</sub>, 1 if it enters vertex v<sub>i</sub> and 0 otherwise (many authors use the opposite sign convention).
'''<font color="#32CD32">矩阵''B''是一个有向图的关联矩阵，其中 ''n'' 和 ''m'' 分别是顶点和边的数目，这样当边 e<sub>j</sub> 离开顶点 v<sub>i</sub>，时为1，当它进入顶点 v<sub>i</sub> ，时为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<sub>j</sub> leaves vertex v<sub>i</sub>, 1 if it enters vertex v<sub>i</sub> and 0 otherwise (many authors use the opposite sign convention).