AdjacencyMatrix.cpp

#include "AdjacencyMatrix.h"

AdjacencyMatrix::AdjacencyMatrix()
{
}

AdjacencyMatrix::AdjacencyMatrix(const char* fileName):
	GraphRepresentation(fileName)
{
	if (!fin.fail()) {
		// Ïåðâàÿ ñòðîêà ôàéëà ñîäåðæèò ÷èñëî n, 
		// îáîçíà÷àþùåå êîëè÷åñòâî âåðøèí ãðàôà:
		fin >> verticesCnt;
		
		adjacencyMatrix = new int*[verticesCnt];
		
		// Ïîñëåäóþùèå n ñòðîê ñîäåðæàò ìàòðèöó ñìåæíîñòè ãðàôà G.
		for (int i = 0; i < verticesCnt; ++i) {
			adjacencyMatrix[i] = new int[verticesCnt];
			for (int j = 0; j < verticesCnt; ++j) {
				fin >> adjacencyMatrix[i][j];
				
				// Äëÿ íåîðèåíòèðîâàííîãî ãðàôà ýëåìåíò adjacencyMatrix[i][j] ìîæåò ïðèíèìàòü çíà÷åíèÿ: 
				// 1 - â ãðàôå èìååòñÿ ðåáðî ìåæäó âåðøèíàìè i è j; 
				// 0 - â ãðàôå îòñóòñòâóåò ðåáðî ìåæäó äàííûìè âåðøèíàìè.
				
				// Äëÿ îðèåíòèðîâàííîãî ãðàôà ÷èñëî adjacencyMatrix[i][j] ìîæåò ïðèíèìàòü çíà÷åíèÿ: 
				// 1 - â ãðàôå èìååòñÿ äóãà, âåäóùàÿ èç âåðøèíû i â âåðøèíó j; 
				// 0 - òàêîâàÿ äóãà â ãðàôå îòñóòñòâóåò.

			}
		}
	}
}

AdjacencyMatrix::~AdjacencyMatrix()
{
	if (adjacencyMatrix) {
		for (int i = 0; i < verticesCnt; ++i) {
			delete [] adjacencyMatrix[i];
		}
		delete [] adjacencyMatrix;
	}
}

int AdjacencyMatrix::isEdgeBetween(int vertex1, int vertex2)
{
	// Åñëè ÷èñëî ð¸áåð èç âåðøèíû vertex1 ãðàôà â âåðøèíó vertex2 ðàâíî 0
	// È    ÷èñëî ð¸áåð èç âåðøèíû vertex2 ãðàôà â âåðøèíó vertex1 áîëüøå 0:
	if (adjacencyMatrix[vertex1][vertex2] == 0 && adjacencyMatrix[vertex2][vertex1] > 0)
		return -1;
	
	else if (adjacencyMatrix[vertex1][vertex2] > 0 && adjacencyMatrix[vertex2][vertex1] == 0)
		return 1;

	return 0;
}

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