#include<vector>
#include<iostream>
using namespace std;
#define MATRIX vector<vector<int>>
vector<int> getDegree(MATRIX m){
int p = m.size();
vector<int> degree(p, 0);
for (int i = 0; i < p; i++){
for (int j = 0; j < p; j++){
degree[i] += m[i][j];
}
}
return degree;
}
MATRIX multi(MATRIX& M1, MATRIX& M2){
int rowN = M1.size();
int columnN = M2[0].size();
MATRIX result;
for (int i = 0; i < rowN; i++){
result.push_back(vector<int>(columnN, 0));
for (int j = 0; j < columnN; j++){
for (int k = 0; k < M2.size(); k++){
result[i][j] += M1[i][k] * M2[k][j];
}
}
}
return result;
}
MATRIX transposition(MATRIX& M){
int rowN = M.size();
int columnN = M[0].size();
MATRIX result;
for (int j = 0; j < columnN; j++){
result.push_back(vector<int>(
DFS求子图同构
最新推荐文章于 2024-08-26 19:43:03 发布
该篇博客介绍了一种利用深度优先搜索(DFS)来判断两个矩阵表示的图是否同构的方法。通过构建和遍历子图,计算并比较矩阵乘积,以确定是否存在同构关系。代码示例展示了如何在C++中实现这一过程。
摘要由CSDN通过智能技术生成