public static double getScoreTopology(Graph[] g, Vector<String>[] seed)
	{
		int i=0, j=0, k=0;
		double scoreTopology=0.0;
		for(i=0;i<seed.length;i++)
	        {
			for(j=i+1;j<seed.length;j++)
			{
				double scorePair=0.0;
				for(k=0;k<seed[i].size();k++)
				{
					double[] mapSource=getAdiacMap(g[i],seed[i],seed[i].get(k));
					double[] mapDest=getAdiacMap(g[j],seed[j],seed[j].get(k));
					scorePair+=getPairwiseScore(mapSource,mapDest);
				}
				scoreTopology+=scorePair;
			}
		}
		scoreTopology=scoreTopology/(seed[0].size()*g.length*(g.length-1)/2);
	        return scoreTopology;
	}