【C语言】判断布尔矩阵是否自反、非自反、对称、非对称、反对称、传递与否，并计算其互补关系和逆矩阵

最新推荐文章于 2024-04-30 23:53:05 发布

汐新酱

最新推荐文章于 2024-04-30 23:53:05 发布

阅读量686

点赞数 28

分类专栏：离散数学文章标签：算法数据结构排序算法 c语言

本文链接：https://blog.csdn.net/xixin2233/article/details/137918145

版权

离散数学专栏收录该内容

8 篇文章 0 订阅

订阅专栏

实验目的

Using C-language to judge whether a Boolean Matrix is reflexive, irreflexive, symmetric, asymmetric, antisymmetric, transitive, or not, and calculate the complementary relation and the inverse.

实验内容

Design the algorithm to judge whether a Boolean Matrix is reflexive, irreflexive, symmetric, asymmetric, antisymmetric, transitive, or not, and calculate the complementary relation and the inverse, and output the result.

使用环境

Win 11 & visual studio code 2022

算法介绍

Algorithm: using alternative branch to judge,

Input: A square matrix about relations

Output: the properties of the matrix and the complement and inverse of the matrix

Begin(inverse)

Step 1: loop through a matrix

Step 2: change the entries of 1 to 0, and 0 to 1.

End: Output the matrix

Begin(complement)

Step 1: loop through the upper triangle of matrix(half a matrix)

Step 2: make a[i][j] = a[j][i] and a[j][i] = a[i][j]

End: Output the matrix

调试过程

调试代码

#include<stdio.h>

int reflex(int arr[10][10],int r);

void symme(int arr[10][10],int r);

void inver(int a[10][10]);

void comp(int a[10][10]);

void main()

{

    int i ,j,R,array1[10][10];

    printf("input the rank of matrix: ");

    scanf("%d",&R);

    printf("input the matrix: ");

    for (i = 0; i < R; i++)

        for (j = 0; j < R; j++)

        {

            scanf("%d", &array1[i][j]);

        }

    symme(array1,R);  //函数中调用了reflex函数

    comp(array1);

    inver(array1);   

}



int reflex(int arr[10][10],int r)  //判断反身性

{

    int i,s=0;

    for (i = 0; i < r; i++)

        if (arr[i][i] == 1) s++;   

    if (s==r) printf("the matrix is reflexive\n");

    else

    {

        if (s==0) printf("the matrix is irreflexive\n");

    }

    return s;

}

void symme(int arr[10][10],int r)  //判断对称性

{

    int i,j,s=0;

    for (i=0;i<r;i++)

        for (j=0;j<r;j++)

            if (arr[i][j]==arr[j][i]) s++;

    if (s == (r*r))

    {

        reflex(arr,r);

        printf("the matrix is symmetric\n");

    }

    else

    {

        if (0 == reflex(arr,r) && s==r) printf("the matrix is asymmetric\n");

        else printf("the matrix is not asymmetric\n");

        printf("the matrix is not symmetric\n");

    }

    if (s==r)  printf("the matrix is not antisymmetric\n");

    else printf("the matrix is not antisymmetric\n");

}

void inver(int a[10][10])  //输出矩阵的逆

{

int b[10][10], i, j, n = 0;

for (i = 0; i < 4; i++)

          for (j = 0; j < 4; j++)

                  b[j][i] = a[i][j];

printf("The inverse of the A matrix is\n");

for (i = 0; i < 4; i++)

{



          for (j = 0; j < 4; j++)

          {

                  printf("%d ", b[i][j]);

                  n++;

                  if (n % 4 == 0)

                  {

                          printf("\n");

                  }

          }

}

}

void comp(int a[10][10])  //输出补关系

{



int i, j;

printf("The complement of the A matrix is\n");

for (i = 0; i < 4; i++)

{

          for (j = 0; j < 4; j++)

          {

                  if (a[i][j] == 1)

                          printf("0 ");

                  if (a[i][j] == 0)

                          printf("1 ");

          }

          printf("\n");

}

}

运行结果

总结

Through the method of writing programs, the distinction between the properties of relation matrix is more understood and clarified. Writing each algorithm into a function can make the program clearer.