#include <cstdio>
#include <iterator>
#include <vector>

#include <boost/graph/adjacency_list.hpp>
#include "biconnected_components.hpp"
using namespace boost;

int main() {
	adjacency_list<vecS, vecS, undirectedS> g(4);
	add_edge(0, 1, g);
	add_edge(1, 2, g);
	add_edge(1, 3, g);
	
	std::vector<int> points;
	articulation_points(g, std::back_inserter(points));
	for (int i = 0; i < (int)points.size(); ++i) {
		printf("%d ", points[i]);
	}
	printf("\n");
}