@Test
	public void testCompleteGraph()
	{
		final DCRGraph graph = new DCRGraph(0.01, 0.3, PInSampler.MEAN);
		final List<Node> nodes = new ArrayList<Node>(100);
		final List<Edge> expectedEdges = new ArrayList<Edge>(100 * 100);
		final OrdinaryCluster fstCl = new OrdinaryCluster(graph, 0.5);
		fstCl.setGroundTruthIndex(0);
		final ClusterAdjacencyList list = new ClusterAdjacencyList(fstCl);
		for (int i = 0; i < 100; ++i)
		{
			final Node node = new Node();
			node.setGtCluster(fstCl);
			list.addNode(node);
			nodes.add(node);
		}

		for (int i = 0; i < 100; ++i)
		{
			for (int j = 0; j < 100; ++j)
			{
				final Pair<Node> nodePair = new Pair<Node>(nodes.get(i), nodes.get(j));
				if (j < i)
				{
					Assert.assertTrue(list.isConnected(nodePair));
				}
				else if (j > i)
				{
					final Edge edge = Edge.createEdge(nodePair);
					Assert.assertTrue(list.isUnconnected(nodePair));
					list.addEdge(edge);
					expectedEdges.add(edge);
					Assert.assertTrue(list.isConnected(nodePair));
					Assert.assertTrue(list.contains(ListUtils.last(expectedEdges)));
				}
			}
		}
	}