public static HashSet<String>[] getAdiacSeed(Graph[] g, Vector<String>[] seed, double densityThresh)
	{
		HashSet<String>[] adiacSeed=new HashSet[g.length];
		int i=0, j=0, k=0;
		for(i=0;i<adiacSeed.length;i++)
		{
			adiacSeed[i]=new HashSet<String>();
			for(j=0;j<seed[i].size();j++)
			{
				HashMap<String,Double> adiac=g[i].getMapNodes().get(seed[i].get(j)).getAdiacs();
				Iterator<String> it=adiac.keySet().iterator();
				while(it.hasNext())
				{
					String adiacNode=it.next();
					double numConn=0;
					HashMap<String,Double> adiacNodeMap=g[i].getMapNodes().get(adiacNode).getAdiacs();
					for(k=0;k<seed[i].size();k++)
					{
						if(adiacNodeMap.containsKey(seed[i].get(k)))
							numConn++;
					}
					if(numConn/seed[i].size()>=densityThresh-0.1)
						adiacSeed[i].add(adiacNode);
				}
			}
			for(j=0;j<seed[i].size();j++)
				adiacSeed[i].remove(seed[i].get(j));
		}
		return adiacSeed;
	}