Diagnol 1's in array

Hi my function FunorRel is not working properly for some reason. I am passing in the array, domain, and range. The purpose of this function is to see if domain is equal to range and the array looks like this:

If domain and range == 4

1000
0100
0010
0001

then it should return true. If it looks like any other way then it should return false. For some reason when I run it, it always returns to false. I am not sure why it is doing this.
  #include <iostream>
#include <vector>

using namespace std; 

const int MAX = 100;

void putinArray(vector <int> & orderedpairs, int arr[MAX][MAX], int dom, int rang); 
bool RelationOrFunction(int arr[MAX][MAX], int dom, int rang);
int SurOrInj(int arr[MAX][MAX], int dom, int rang); 
bool Reflexive(vector <int> pairs, int dom);
bool Symmetric(vector <int> pairs);
bool Antisymmetric(vector <int> pairs);
bool Transitive(vector <int> pairs);
bool FunandRel(int arr[MAX][MAX], int dom, int rang);
void printArray(int arr[MAX][MAX], int dom, int rang);

int main()
{
	int testcase, domain, range, pairs, p;
	int i = 0; 
	int j = 0;
	vector <int> nums;
	int arr[MAX][MAX] = {{0}}; 
	
	cout << "Please input the amount of test cases: "; 
	cin >> testcase; 
	cout << endl; 

	while(i < testcase)
	{
		cout << "Please type the amount of ordered pairs: "; 
		cin >> pairs; 
		cout << endl; 

		cout << "Please type the range of the domain: "; 
		cin >> domain; 
		cout << endl;

		cout << "Please type the range of the range: "; 
		cin >> range; 
		cout << endl;

		cout << "Please type the pairs: " ; 
		while(j < (pairs * 2))
		{
			cin >> p; 
			nums.push_back(p);
			j++;
		}
		putinArray(nums,arr,domain,range);
		printArray(arr,domain,range);		
		
		if(RelationOrFunction(arr,domain,range))
		{
			cout << "Function "; 
			if(SurOrInj(arr,domain,range) == 1)
			{
				cout << "Injective "; 
			}
			else if(SurOrInj(arr,domain,range) == 2)
			{
				cout << "Surjective "; 
			}
			else if(SurOrInj(arr,domain,range) == 3)
			{
				cout << "Injective Surjective Bijective "; 
			}
			else if(SurOrInj(arr,domain,range) == 4)
			{
				cout << " "; 
			}
			else if(FunandRel(arr,domain,range))
			{
				cout << "Relation Reflexive Symmetric Antisymmetric Transitive "; 
			}
		}
		else 
		{
			cout << "Relation "; 
			
			if(Reflexive(nums,domain))
			{
				cout << "Reflexive "; 
			}
			if(Symmetric(nums))
			{
				cout << "Symmetric "; 
			}
			if(Antisymmetric(nums))
			{
				cout << "Antisymmetric "; 
			}
			if(Transitive(nums))
			{
				cout << "Transitive "; 
			}
			
		}
		cout << endl;
		i++;
	}

	





	return 0; 
}

void putinArray(vector <int> &orderedpairs, int arr[MAX][MAX], int dom, int rang)
{
	const int MAX = 100; 
	
	
	for(int i = 0; i < orderedpairs.size(); i = i + 2)
	{
		arr[orderedpairs[i] - 1][orderedpairs[i+1] - 1] = 1; 
	}
}

bool RelationOrFunction(int arr[MAX][MAX], int dom, int rang)
{
	int total = 0;

	for(int i = 0; i < dom; i++)
	{
		for(int j = 0; j < rang; j++)
		{
			total = arr[i][j] + total; 
		}
		
		if(total == 1)
		{
			total = 0;
			continue; 
		}
		else
		{
				return false; 
		}
	}
	return true; 
}

int SurOrInj(int arr[MAX][MAX], int dom, int rang)
{
	int total = 0;
	
	for(int i = 0; i < dom; i++)
		{
			for(int j = 0; j < rang; j++)
			{
				total = arr[j][i] + total;
			}
			if(total >= 1)
			{
				total = 0;
				continue; 
			}
		}
		if(dom < rang)
		{
			return 1; //injective
		}
	
	for(int i = 0; i < dom; i++)
	{
		for(int j = 0; j < rang; j++)
		{
			total = arr[j][i] + total;
		}
		if(total <= 1)
		{
			total = 0;
			continue; 
		}
	}
	if(dom > rang)
	{
		return 2; //surjective
	}

	for(int i = 0; i < dom; i++)
	{
		for(int j = 0; j < rang; j++)
		{
			total = arr[j][i] + total;
		}
		if(total == 1)
		{
			total = 0;
			continue; 
		}
	}
	if(dom == rang)
	{
		return 3; //bijective
	}

	for(int i = 0; i < dom; i++)
	{
		for(int j = 0; j < rang; j++)
		{
			total = arr[j][i] + total;
		}
		if(total >= dom)
		{
			return 4; //none
		}
	}

	

}

bool Reflexive(vector <int> pairs, int dom)
{
	int j = 1;
	
	while(j <= dom)
	{
		for(int i = 0; i < pairs.size(); i = i+2)
		{
			if(pairs[i] == j && pairs[i+1] == j)
			{
				j++;
				
			}
		}
	}
	return true;
}

bool Symmetric(vector <int> pairs)
{
	int a, b;

	for(int i = 0; i < pairs.size(); i=i+2)
	{
		if(pairs[i] != pairs[i+1])
		{
			a = pairs[i]; 
			b = pairs[i+1];
			for(int j = 0; j < pairs.size(); j = j+2)
			{
				if(pairs[j] == b && pairs[j+1] == a)
				{
					return true; 
				}
			}
		}
	}
	return false; 
}

bool Antisymmetric(vector <int> pairs)
{
	int a, b;

	for(int i = 0; i < pairs.size(); i=i+2)
	{
		if(pairs[i] != pairs[i+1])
		{
			a = pairs[i]; 
			b = pairs[i+1];
			for(int j = 0; j < pairs.size(); j=j+2)
			{
				if(pairs[j] == b && pairs[j+1] == a)
				{
					return false; 
				}
			}
		}
	}
	return true; 
}

bool Transitive(vector <int> pairs)
{
	int a, b, c; 
	
	for(int i = 0; i < pairs.size(); i=i+2)
	{
		if(pairs[i] != pairs[i+1])
		{
			a = pairs[i]; 
			b = pairs[i+1];
			for(int j = 0; j < pairs.size(); j = j+2)
			{
				if((pairs[i] == b) && (pairs[i+1] != a))
				{
					c = pairs[i+1]; 
					for(int k = 0; k < pairs.size(); k = k+2)
					{
						if((pairs[i] == a) && (pairs[i+1] == c))
						{
							return true; 
						}
					}
				}
			}
		}
	}
	return false;
}

bool FunandRel(int arr[MAX][MAX], int dom, int rang)
{
	if(dom == rang)
	{
		for(int i = 0; i < dom; i++)
		{
			for(int j = 0; j < rang; j++)
			{
				if(i == j)
				{
					if(arr[i][j] == 1)
					{
						continue; 
					}
					else 
					{
						return false;
					}
				}
			}
		}
	}
		
	
	return true;
}

void printArray(int arr[MAX][MAX], int dom, int rang)
{
	for(int i = 0; i < dom; i++)
		{
			for(int j = 0; j < rang; j++)
			{
				cout << arr[i][j]; 
			}
			cout << endl; 
		}
}
Topic archived. No new replies allowed.
C++

Forum

Diagnol 1's in array
