weightedGraph.h

#ifndef _WEIGHTED_GRAPH_H
#define _WEIGHTED_GRAPH_H

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

class WeightedGraph {
	std::vector< std::vector<int> > connections;
public:
	WeightedGraph(const int &numberOfNodes);
	void connectNodes(const int &node1, const int &node2, const int &weight);
	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);
};

#endif //_WEIGHTED_GRAPH_H