// simple test  - make a cycle
#include <iostream>
#include "graph.h"


int main() {
	graph g;
	setAdjacent(1, 2, g);
	setAdjacent(2, 3, g);
	setAdjacent(3, 4, g);
	setAdjacent(4, 5, g);
	setAdjacent(5, 6, g);
	setAdjacent(6, 1, g);
	write( std::cout, g);
	std::cout << areAdjacent(1, 6, g) << areAdjacent(3, 5, g)
	<< areAdjacent(1, 10, g) << std::endl;
	// expect 100
}