4结点图的同构判定方法

#include<iostream>

using std::cout;

using std::cin;

void juzhenshuru(booljuzhen[4][4])

{

         cout<<"请输入标准的矩阵";

         for(intm=0;m<4;m++)

         {

                   for(intn=0;n<4;n++)

                   {

                            cin>>juzhen[m][n];

                   }

         }

}

int panding(inta,intb,intc,intd,booljuzhencanshu1[4][4],booljuzhencanshu2[4][4])

{

         if(juzhencanshu1[0][0]!=juzhencanshu2[a][a])return0;

         if(juzhencanshu1[0][1]!=juzhencanshu2[a][b])return0;

         if(juzhencanshu1[0][2]!=juzhencanshu2[a][c])return0;

         if(juzhencanshu1[0][3]!=juzhencanshu2[a][d])return0;

         if(juzhencanshu1[1][0]!=juzhencanshu2[b][a])return0;

         if(juzhencanshu1[1][1]!=juzhencanshu2[b][b])return0;

         if(juzhencanshu1[1][2]!=juzhencanshu2[b][c])return0;

         if(juzhencanshu1[1][3]!=juzhencanshu2[b][d])return0;

         if(juzhencanshu1[2][0]!=juzhencanshu2[c][a])return0;

         if(juzhencanshu1[2][1]!=juzhencanshu2[c][b])return0;

         if(juzhencanshu1[2][2]!=juzhencanshu2[c][c])return0;

         if(juzhencanshu1[2][3]!=juzhencanshu2[c][d])return0;

         if(juzhencanshu1[3][0]!=juzhencanshu2[d][a])return0;

         if(juzhencanshu1[3][1]!=juzhencanshu2[d][b])return0;

         if(juzhencanshu1[3][2]!=juzhencanshu2[d][c])return0;

         if(juzhencanshu1[3][3]!=juzhencanshu2[d][d])return0;

         elsereturn1;

}

int main()

{

         boola[4][4],b[4][4];

         juzhenshuru(a);juzhenshuru(b);

         if(panding(0,1,2,3,a,b))cout<<"同构";return 0;

         if(panding(0,1,3,2,a,b))cout<<"同构";return 0;

         if(panding(0,2,1,3,a,b))cout<<"同构";return 0;

         if(panding(0,2,3,1,a,b))cout<<"同构";return 0;

         if(panding(0,3,2,1,a,b))cout<<"同构";return 0;

         if(panding(0,3,1,2,a,b))cout<<"同构";return 0;

         if(panding(1,0,2,3,a,b))cout<<"同构";return 0;

         if(panding(1,0,3,2,a,b))cout<<"同构";return 0;

         if(panding(1,2,0,3,a,b))cout<<"同构";return 0;

         if(panding(1,2,3,0,a,b))cout<<"同构";return 0;

         if(panding(1,3,2,0,a,b))cout<<"同构";return 0;

         if(panding(1,3,0,2,a,b))cout<<"同构";return 0;

         if(panding(2,1,0,3,a,b))cout<<"同构";return 0;

         if(panding(2,1,3,0,a,b))cout<<"同构";return 0;

         if(panding(2,0,3,1,a,b))cout<<"同构";return 0;

         if(panding(2,0,1,3,a,b))cout<<"同构";return 0;

         if(panding(2,3,0,1,a,b))cout<<"同构";return 0;

         if(panding(2,3,1,0,a,b))cout<<"同构";return 0;

         if(panding(3,1,2,0,a,b))cout<<"同构";return 0;

         if(panding(3,1,0,2,a,b))cout<<"同构";return 0;

         if(panding(3,2,1,0,a,b))cout<<"同构";return 0;

         if(panding(3,2,0,1,a,b))cout<<"同构";return 0;

         if(panding(3,0,2,1,a,b))cout<<"同构";return 0;

         if(panding(3,0,1,2,a,b))cout<<"同构";return 0;

         cout<<"不是同构";

         return0;

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值