private HashMap<String, Double> partitionComparator(Collection<Output> testedGraph) {
		HashMap<String, Double> cp = new HashMap<String, Double>();
		for (Output o1 : testedGraph) {
			for (Output o2 : testedGraph) {
				if (!o1.equals(o2)) {
					double similarity = 0;
					for (Set<Node> g1 : o1.getCommunities()) {
						for (Set<Node> g2 : o2.getCommunities()) {
							similarity += (double) CollectionUtils.intersection(g1, g2).size() / (double) CollectionUtils.union(g1, g2).size();
						}
					}
					similarity /= (double) (o1.getCommunities().size() + o2.getCommunities().size()) / 2.0;
					cp.put(o1.getProperties().getProperty("algorithmType") + " " + o2.getProperties().getProperty("algorithmType"), similarity);
				}
			}
		}
		return cp;
	}