Description: Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, \"g++ -o span_forest span_forest.c\". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part. -Computes estimates for the number of fores ts of a graph. input as a 0-1 incidence matrix. Notes : Compile in C, "g-o span_forest span_forest.c." The program does not demand that the matrix is symmetric wit h 0 diagonal. but uses only the upper triangular part. Platform: |
Size: 3545 |
Author:卢松 |
Hits:
Description: Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part. -Computes estimates for the number of fores ts of a graph. input as a 0-1 incidence matrix. Notes : Compile in C, "g-o span_forest span_forest.c." The program does not demand that the matrix is symmetric wit h 0 diagonal. but uses only the upper triangular part. Platform: |
Size: 3072 |
Author:卢松 |
Hits:
Description: 复杂无向图网络绘图，包括处理邻接矩阵和关联矩阵，具体使用方法可以通过help netplot查询。-Complex network undirected graph drawing, including processing adjacency matrix and incidence matrix, the specific method of use can help netplot queries. Platform: |
Size: 1024 |
Author:许铭 |
Hits:
Description: 在data表格中输入电网络中图论的节点、支路、阻抗等信息，程序将自动生成关联矩阵。-Enter the electric network graph theory in the data table nodes, branches, impedance and other information, the program will automatically generate the correlation matrix. Platform: |
Size: 6144 |
Author:cby |
Hits:
Search - graph incidence matrix