程序求等价闭包

/*
Date: 9-25-2015
Coded by: 
*/


#pragma warning(disable:4996)
#include <cstdio>
#include <iostream>
#include <Windows.h>
#include <ctime>
#include <stdlib.h>
#include "queue.h"
//#include "mystack.h"
//#include "linkedstack.h"
//#include "myqueue.h"
//#include "chain.h"


#define FILENAME "test2.txt"
#define M 100


using namespace std;






int arr[M][M];


//show the mat
void show(int MAT[][M], int n)
{
int i, j;
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
printf(" %d", MAT[i][j]);
}
printf("\n");
}

}


void makeRef(int n)
{
int i;
for (i = 0; i < n; i++)
{
arr[i][i] = arr[i][i] | 1;
}
}


void makeSys(int n)
{
int i, j;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
{
if (arr[i][j])
arr[j][i] = arr[j][i] | 1;
}
}


void makeTransitive(int n)
{
int i, j, k;
for (k = 0; k < n; k++)
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
{
if (arr[i][k] && arr[k][j])
arr[i][j] = arr[i][j] | 1;
}
}


int main()
{

int n;
int i, j;
freopen(FILENAME, "r", stdin);

scanf("%d", &n);
if (n > 0)
{
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
scanf("%d", &arr[i][j]);
cout << "转换前：\n";
show(arr, n);
makeRef(n);
makeSys(n);
makeTransitive(n);
cout << endl;
show(arr, n);
}
Sleep(100000);



system("pause");
return 0;
}