graph.h

#ifndef _GRAPH_H
#define _GRAPH_H

#include <iostream>
#include <vector>
#include <algorithm>
#include "helper.h"

class Graph {
	std::vector< std::vector<bool> > connections;
public:
	Graph(const int &numberOfNodes);
	void connectNodes(const int &node1, const int &node2);
	void disconnectNodes(const int &node1, const int &node2);
	void printAdjacencyMatrix();
	bool isPath(const int &node1, const int &node2);
	bool searchPath(const int &node1, const int &node2, std::vector<int> *visitedNodes);
	bool isConnected();
};

#endif //_GRAPH_H