graph.hpp

#ifndef GRAPH_HPP
#define GRAPH_HPP

#include <vector>
#include <iostream>
#include <algorithm>
#include <limits>

struct Node {
	int id;
	Node(int id) : id(id) {}
};

class Graph {
	std::vector<Node *> nodes;
	std::vector<std::vector<int>> matrix;

	int getIndexFromId(const int &id) const;
public:
	const int infinity;

	Graph();
	bool addNode(Node *node);
	void removeNode(const int &id);
	bool addEdge(const int &id1, const int &id2, const int &distance);
	void removeEdge(const int &id1, const int &id2);
	int size() const;
	friend std::ostream &operator<<(std::ostream &os, const Graph &g);
};


#endif // GRAPH_HPP