X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/24dbcb1a8071fe684d776063f04b314d92094e8d..23da67335f942457b0d8b1f10e9849eba0eee9f7:/contrib/psg/src/peersim/graph/FastUndirGraph.java

diff --git a/contrib/psg/src/peersim/graph/FastUndirGraph.java b/contrib/psg/src/peersim/graph/FastUndirGraph.java
deleted file mode 100644
index 9f5de5e40a..0000000000
--- a/contrib/psg/src/peersim/graph/FastUndirGraph.java
+++ /dev/null
@@ -1,95 +0,0 @@
-/*
- * Copyright (c) 2003-2005 The BISON Project
- *
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License version 2 as
- * published by the Free Software Foundation.
- *
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
- *
- */
-
-/*
- * Created on Jan 30, 2005 by Spyros Voulgaris
- *
- */
-package peersim.graph;
-
-import java.util.ArrayList;
-import java.util.BitSet;
-
-/**
-* Speeds up {@link ConstUndirGraph#isEdge} by storing the links in an
-* adjacency matrix (in fact in a triangle).
-* Its memory consumption is huge but it's much faster if the isEdge method
-* of the original underlying graph is slow.
-*/
-public class FastUndirGraph extends ConstUndirGraph
-{
-
-private BitSet[] triangle;
-
-
-// ======================= initializarion ==========================
-// =================================================================
-
-
-/** Calls super constructor */
-public FastUndirGraph(Graph graph)
-{
-	super(graph);
-}
-
-// -----------------------------------------------------------------
-
-protected void initGraph()
-{
-	final int max = g.size();
-	triangle = new BitSet[max];
-	for (int i=0; i<max; ++i)
-	{
-		in[i] = new ArrayList<Integer>();
-		triangle[i] = new BitSet(i);
-	}
-
-	for(int i=0; i<max; ++i)
-	{
-		for(Integer out:g.getNeighbours(i))
-		{
-			int j=out.intValue();
-			if( ! g.isEdge(j,i) )
-				in[j].add(i);
-			// But always add the link to the triangle
-			if (i>j) // make sure i>j
-				triangle[i].set(j);
-			else
-				triangle[j].set(i);
-		}
-	}
-}
-
-
-// ============================ Graph functions ====================
-// =================================================================
-
-
-public boolean isEdge(int i, int j)
-{
-	// make sure i>j
-	if (i<j)
-	{
-		int ii=i;
-		i=j;
-		j=ii;
-	}
-	return triangle[i].get(j);
-}
-}
-