Loading docs/math/gauss.md +1 −1 Original line number Diff line number Diff line Loading @@ -239,7 +239,7 @@ $D = \left| A \right| = \sum(-1)^va_{1,l_1}a_{2,l_2}\dots a_{n,l_n}$ 一个无向图的生成树个数为邻接矩阵度数矩阵去一行一列的行列式。 详见：[矩阵树定理]\(/misc/matrix-tree/ 详见：[矩阵树定理](/misc/matrix-tree/) 例如，一个正方形图的生成树个数 Loading Loading
docs/math/gauss.md +1 −1 Original line number Diff line number Diff line Loading @@ -239,7 +239,7 @@ $D = \left| A \right| = \sum(-1)^va_{1,l_1}a_{2,l_2}\dots a_{n,l_n}$ 一个无向图的生成树个数为邻接矩阵度数矩阵去一行一列的行列式。 详见：[矩阵树定理]\(/misc/matrix-tree/ 详见：[矩阵树定理](/misc/matrix-tree/) 例如，一个正方形图的生成树个数 Loading
