Graph-Algorithms-Task1/filemanager.cpp at master · werweg/Graph-Algorithms-Task1 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include "filemanager.h"

void FileManager::writeToFile(Graph* graph,std::string path)
{
	bool** Matrix = graph->getAdjacencyMatrix();
	int verticesNumber = graph->getVerticesNumber();

    std::ofstream file(path.c_str());

	if(file.is_open())
	{
		file << verticesNumber;
		file << " ";

		for(int i=0; i<verticesNumber; i++)
		{
			for(int j=0; j<verticesNumber; j++)
			{
				file << Matrix[i][j];
				file << " ";
			}
		}
	}

	file.close();
}

Graph* FileManager::readFromFile(std::string path)
{

	bool** Matrix;
	int verticesNumber;

    std::ifstream file(path.c_str());

    if(!file.is_open()){
        return NULL;
    }

    file >> verticesNumber;

    Matrix = new bool*[verticesNumber];
    for(int i=0; i<verticesNumber; i++){
        Matrix[i] = new bool[verticesNumber];
    }

    for(int i=0; i<verticesNumber; i++)
    {
        for(int j=0; j<verticesNumber; j++)
        {
            file >> Matrix[i][j];
        }
    }


	file.close();

	return new Graph(Matrix, verticesNumber);
}