AdjacencyList.cpp

#include "AdjacencyList.h"

AdjacencyList::AdjacencyList()
{
}

AdjacencyList::AdjacencyList(const char* fileName):
	GraphRepresentation(fileName)
{
	if (!fin.fail()) {
		// Ïåðâàÿ ñòðîêà ôàéëà ñîäåðæèò ÷èñëî n, 
		// îáîçíà÷àþùåå êîëè÷åñòâî ð¸áåð ãðàôà:
		fin >> edgesCnt;
		
		adjacencyList = new int*[edgesCnt];
		
		// Ïîñëåäóþùèå n ñòðîê ñîäåðæàò ñïèñêè ñìåæíîñòè, ãäå i-àÿ ñòðîêà ñïèñêà çàäàåòñÿ ñëåäóþùèì îáðàçîì:
		// Ni gi1 gi2 ... giNi , 
		// ãäå Ni - êîëè÷åñòâî ñìåæíûõ ñ i-îé âåðøèíîé âåðøèí ãðàôà; 
		//     gi1 gi2 ... giNi - ïîñëåäîâàòåëüíîñòü (ñïèñîê) âåðøèí, ñìåæíûõ ñ i-îé âåðøèíîé ãðàôà G.
		for (int i = 0; i < edgesCnt; ++i) {
			int cnt;
			fin >> cnt;
			
			adjacencyList[i] = new int[cnt];
			for (int j = 0; j < cnt; ++j) {
				fin >> adjacencyList[i][j];
			}
		}
	}
}

AdjacencyList::~AdjacencyList()
{
	if (adjacencyList) {
		for (int i = 0; i < edgesCnt; ++i) {
			delete [] adjacencyList[i];
		}
		delete [] adjacencyList;
	}
}

int AdjacencyList::isEdgeBetween(int vertex1, int vertex2)
{
	return 0;
}

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