IncidenceMatrix.cpp

#include "IncidenceMatrix.h"

IncidenceMatrix::IncidenceMatrix()
{
}

IncidenceMatrix::IncidenceMatrix(const char* fileName):
	GraphRepresentation(fileName)
{
	if (!fin.fail()) {
		//  ïåðâîé ñòðîêå ôàéëà äàíû äâà ÷èñëà: 
		// n - êîëè÷åñòâî âåðøèí ãðàôà, 
		// m - êîëè÷åñòâî ð¸áåð ãðàôà.
		fin >> verticesCnt >> edgesCnt;
		
		incidenceMatrix = new int*[verticesCnt];
		
		// Äàëåå ñîäåðæèòñÿ ìàòðèöà èíöèäåíöèé ðàçìåðîì (n x m):
		for (int n = 0; n < verticesCnt; ++n) {
			incidenceMatrix[n] = new int[edgesCnt];
			for (int m = 0; m < edgesCnt; ++m) {
				fin >> incidenceMatrix[n][m];
			}
		}
	}
}

IncidenceMatrix::~IncidenceMatrix()
{
	if (incidenceMatrix) {
		for (int n = 0; n < verticesCnt; ++n) {
			delete [] incidenceMatrix[n];
		}
		delete [] incidenceMatrix;
	}
}

int IncidenceMatrix::isEdgeBetween(int vertex1, int vertex2)
{
	for (int m = 0; m < edgesCnt; ++m) {
		// Åñëè vertex1 èíöèäåíòíà ðåáðó m, è ÿâëÿåòñÿ åãî êîíöîì
		// È    vertex2 èíöèäåíòíà ðåáðó m, è ÿâëÿåòñÿ åãî íà÷àëîì:
		if (incidenceMatrix[vertex1][m] < 0 && incidenceMatrix[vertex2][m] > 0)
			return -1;
		
		else if (incidenceMatrix[vertex1][m] != 0 && incidenceMatrix[vertex2][m] != 0)
			return 1;
	}
	
	return 0;
}

int IncidenceMatrix::getEdgeWeightBetween(int vertex1, int vertex2)
{
	return 1;
}