RError.com

RError.com Logo RError.com Logo

RError.com Navigation

  • 主页

Mobile menu

Close
  • 主页
  • 系统&网络
    • 热门问题
    • 最新问题
    • 标签
  • Ubuntu
    • 热门问题
    • 最新问题
    • 标签
  • 帮助
主页 / 问题 / 1293468
Accepted
Stark
Stark
Asked:2022-06-09 19:41:46 +0000 UTC2022-06-09 19:41:46 +0000 UTC 2022-06-09 19:41:46 +0000 UTC

如何删除矩阵?

  • 772

如何去除矩阵?我收到此错误在此处输入图像描述

#include <iostream>
#include <algorithm>
#include <windows.h>
#include <omp.h>
using namespace std;
class Graph {
private:
    bool** adjMatrix;
    bool** Pmatrix;
    int numVertices;
    int* p; // перестановка
public:
    Graph(int numVertices) {
        this->numVertices = numVertices;
        adjMatrix = new bool* [numVertices];
        Pmatrix = new bool* [numVertices];
        for (int i = 0; i < numVertices; i++) {
            adjMatrix[i] = new bool[numVertices];
            Pmatrix[i] = new bool[numVertices];
            for (int j = 0; j < numVertices; j++) {
                adjMatrix[i][j] = false;
                Pmatrix[i][j] = false;
            }
        }
        p = new int[numVertices];
        for (int i = 0; i < numVertices; i++)
            p[i] = i;
    }

    int getNumVertices() {
        return numVertices;
    }

    void addEdge(int i, int j) {
        adjMatrix[i][j] = true;
        adjMatrix[j][i] = true;
    }

    int* getP() {
        return p;
    }

    bool** getAdjMatrix() {
        return adjMatrix;
    }

    int* retPer() {
        next_permutation(p, p + numVertices);
        cout << "Перестановка" << endl;
        for (int i = 0; i < numVertices; i++)
            cout << p[i] << " ";
        cout << endl;
        return p;
    }

    bool** retPmatrix(int* p) {  
        for (int i = 0; i < numVertices; i++)
            for (int j = 0; j < numVertices; j++)
                Pmatrix[i][j] = false;
        for (int i = 0; i < numVertices; i++)
            Pmatrix[p[i]][i] = true;
        return Pmatrix;
    }

    bool** traspPmatrix(bool** Pmatrix) {
        bool** tPmatrix = new bool* [numVertices];
        for (int i = 0; i < numVertices; i++) {
            tPmatrix[i] = new bool[numVertices];
            for (int j = 0; j < numVertices; j++)
                tPmatrix[i][j] = Pmatrix[j][i];
        }
        return tPmatrix;
    }

    bool** mulMatrix(bool** A, bool** B) {
        bool** C = new bool* [numVertices];
        int i, j, k;
        for (i = 0; i < numVertices; i++) {
            C[i] = new bool[numVertices];
            for (j = 0; j < numVertices; j++)
                C[i][j] = false;
        }
        for (i = 0; i < numVertices; i++) {
            for (j = 0; j < numVertices; j++)
                for (k = 0; k < numVertices; k++)
                    C[i][j] = C[i][j] || (A[i][k] && B[k][j]);
        }
        return C;
    }

    void printMatrix(bool** Matrix) {
        for (int i = 0; i < numVertices; i++) {
            cout << i << " : ";
            for (int j = 0; j < numVertices; j++)
                cout << Matrix[i][j] << " ";
            cout << endl;
        }
        cout << endl;
    }

    Graph(const Graph &graph) : adjMatrix(graph.adjMatrix), Pmatrix(graph.Pmatrix),
        numVertices(graph.numVertices), p(graph.p) {}

    ~Graph() {
        for (int i = 0; i < numVertices; ++i) {
            delete[] adjMatrix[i];
            delete[] Pmatrix[i];
        }
        delete[] adjMatrix;
        delete[] Pmatrix;
        delete p;
    }
};

bool isIsomorph(Graph g1, Graph g2) {
    int* Per = g1.getP();
    bool** Iso = g1.mulMatrix(g1.mulMatrix(g1.retPmatrix(Per), g1.getAdjMatrix()), g1.traspPmatrix(g1.retPmatrix(Per)));
    if (g2.getAdjMatrix() == Iso)
        return 1;
    else
        return 0;
}

int main() {
    SetConsoleCP(1251);
    SetConsoleOutputCP(1251);
    double start_time, end_time;
    Graph g1(4), g2(4);
    //GRAPH1////////
    g1.addEdge(0, 1);
    g1.addEdge(0, 2);
    g1.addEdge(1, 2);
    g1.addEdge(2, 3);
    //GRAPH2/////////
    g2.addEdge(0, 1);
    g2.addEdge(0, 2);
    g2.addEdge(1, 2);
    g2.addEdge(2, 3);
    
    if (g1.getNumVertices() == g2.getNumVertices()) {
        if (g1.getAdjMatrix() != g2.getAdjMatrix()) {
            cout << "Матрица смежности графа А" << endl;
            g1.printMatrix(g1.getAdjMatrix());
            cout << "Матрица смежности графа B" << endl;
            g2.printMatrix(g2.getAdjMatrix());
            cout << "Первоначальная перестановка = [0, 1, 2, 3]" << endl; //ее не видно

            start_time = omp_get_wtime();
            if (isIsomorph(g1, g2))
                cout << "Графы изоморфны" << endl;
            else
                cout << "Графы НЕ изоморфны" << endl;
            end_time = omp_get_wtime();
            printf("Время на замер времени %lf\n", end_time - start_time);
        }
        else
            cout << "Вы ввели идентичные графы с одинаковыми матрицами смежностями, проверка на изоморфизм не требуется" << endl;
    }
    else
        cout << "Error: Количество вершин не совпадает, проверка на изоморфизм отклоняется" << endl;
}
c++
  • 1 1 个回答
  • 10 Views

1 个回答

  • Voted
  1. Best Answer
    Harry
    2022-06-09T20:22:01Z2022-06-09T20:22:01Z

    好吧,看看如果你突然复制会发生什么:

     Graph(const Graph &graph) : adjMatrix(graph.adjMatrix), Pmatrix(graph.Pmatrix),
        numVertices(graph.numVertices), p(graph.p) {}
    

    两个对象的指针将指向内存中的相同位置。这就是所谓的浅(表面)复制。

    移除时

    ~Graph() {
        for (int i = 0; i < numVertices; ++i) {
            delete[] adjMatrix[i];
            delete[] Pmatrix[i];
        }
        delete[] adjMatrix;
        delete[] Pmatrix;
        delete p;
    }
    

    两个对象中的相同指针将导致内存在同一地址再次被释放......

    在这里你需要一个深拷贝 - 即 为相同大小的矩阵分配新内存并重新复制所有元素...

    • 1

相关问题

  • 编译器和模板处理

  • 指针。找到最小数量

  • C++,关于枚举类对象初始化的问题

  • 函数中的二维数组

  • 无法使用默认构造函数创建类对象

  • C++ 和循环依赖

Sidebar

Stats

  • 问题 10021
  • Answers 30001
  • 最佳答案 8000
  • 用户 6900
  • 常问
  • 回答
  • Marko Smith

    表格填充不起作用

    • 2 个回答
  • Marko Smith

    提示 50/50,有两个,其中一个是正确的

    • 1 个回答
  • Marko Smith

    在 PyQt5 中停止进程

    • 1 个回答
  • Marko Smith

    我的脚本不工作

    • 1 个回答
  • Marko Smith

    在文本文件中写入和读取列表

    • 2 个回答
  • Marko Smith

    如何像屏幕截图中那样并排排列这些块?

    • 1 个回答
  • Marko Smith

    确定文本文件中每一行的字符数

    • 2 个回答
  • Marko Smith

    将接口对象传递给 JAVA 构造函数

    • 1 个回答
  • Marko Smith

    正确更新数据库中的数据

    • 1 个回答
  • Marko Smith

    Python解析不是css

    • 1 个回答
  • Martin Hope
    Alexandr_TT 2020年新年大赛! 2020-12-20 18:20:21 +0000 UTC
  • Martin Hope
    Alexandr_TT 圣诞树动画 2020-12-23 00:38:08 +0000 UTC
  • Martin Hope
    Air 究竟是什么标识了网站访问者? 2020-11-03 15:49:20 +0000 UTC
  • Martin Hope
    Qwertiy 号码显示 9223372036854775807 2020-07-11 18:16:49 +0000 UTC
  • Martin Hope
    user216109 如何为黑客设下陷阱,或充分击退攻击? 2020-05-10 02:22:52 +0000 UTC
  • Martin Hope
    Qwertiy 并变成3个无穷大 2020-11-06 07:15:57 +0000 UTC
  • Martin Hope
    koks_rs 什么是样板代码? 2020-10-27 15:43:19 +0000 UTC
  • Martin Hope
    Sirop4ik 向 git 提交发布的正确方法是什么? 2020-10-05 00:02:00 +0000 UTC
  • Martin Hope
    faoxis 为什么在这么多示例中函数都称为 foo? 2020-08-15 04:42:49 +0000 UTC
  • Martin Hope
    Pavel Mayorov 如何从事件或回调函数中返回值?或者至少等他们完成。 2020-08-11 16:49:28 +0000 UTC

热门标签

javascript python java php c# c++ html android jquery mysql

Explore

  • 主页
  • 问题
    • 热门问题
    • 最新问题
  • 标签
  • 帮助

Footer

RError.com

关于我们

  • 关于我们
  • 联系我们

Legal Stuff

  • Privacy Policy

帮助

© 2023 RError.com All Rights Reserve   沪ICP备12040472号-5