From b086f57f56bf0eb9dab9cf321a0f69aaaae84347 Mon Sep 17 00:00:00 2001
From: Andrew Branson <andrew.branson@cern.ch>
Date: Wed, 30 May 2012 08:37:45 +0200
Subject: Initial Maven Conversion

---
 .../graph/layout/DefaultGraphLayoutGenerator.java  | 116 ---------------------
 .../com/c2kernel/graph/layout/IntegerWrapper.java  |  13 ---
 2 files changed, 129 deletions(-)
 delete mode 100644 source/com/c2kernel/graph/layout/DefaultGraphLayoutGenerator.java
 delete mode 100755 source/com/c2kernel/graph/layout/IntegerWrapper.java

(limited to 'source/com/c2kernel/graph/layout')

diff --git a/source/com/c2kernel/graph/layout/DefaultGraphLayoutGenerator.java b/source/com/c2kernel/graph/layout/DefaultGraphLayoutGenerator.java
deleted file mode 100644
index 8ab91ef..0000000
--- a/source/com/c2kernel/graph/layout/DefaultGraphLayoutGenerator.java
+++ /dev/null
@@ -1,116 +0,0 @@
-package com.c2kernel.graph.layout;
-
-import java.util.Vector;
-
-import com.c2kernel.graph.model.DirectedEdge;
-import com.c2kernel.graph.model.GraphModel;
-import com.c2kernel.graph.model.GraphPoint;
-import com.c2kernel.graph.model.Vertex;
-import com.c2kernel.utils.Logger;
-
-public class DefaultGraphLayoutGenerator {
-    private static int mTopMargin = 100;
-    private static int mLeftMargin = 100;
-    private static int mHorzGap = 180;
-    private static int mVertGap = 100;
-
-    private DefaultGraphLayoutGenerator() {
-    }
-
-    public static void layoutGraph(GraphModel graphModel) {
-        Vertex start = graphModel.getStartVertex();
-        Vector<Vector<Vertex>> rowVector = new Vector<Vector<Vertex>>(10, 10);
-        int[] midPoints = null;
-        IntegerWrapper valueOfLargestMidPoint = new IntegerWrapper(0);
-        if (start == null) {
-            Logger.msg(1,"Error graph must have a starting vertex to be layed out");
-            return;
-        }
-        graphModel.clearTags(start);
-        visitVertex(graphModel, start, 0, rowVector, start);
-        midPoints = new int[rowVector.size()];
-        calculateRowMidPoints(rowVector, midPoints, valueOfLargestMidPoint);
-        fillInVertexLocations(graphModel, rowVector, valueOfLargestMidPoint, midPoints);
-        fillInEdgeLocations(graphModel);
-        graphModel.forceNotify();
-    }
-
-    private static void visitVertex(GraphModel graphModel, Vertex vertex, int rowIndex, Vector<Vector<Vertex>> rowVector, Object tag) {
-        int i = 0;
-        Vertex[] children = graphModel.getOutVertices(vertex);
-        vertex.setTag(tag);
-        addVertexToRow(vertex, rowIndex, rowVector);
-        for (i = 0; i < children.length; i++) {
-            if (!(children[i].hasTag(tag))) {
-                visitVertex(graphModel, children[i], rowIndex + 1, rowVector, tag);
-            }
-        }
-    }
-
-    private static void addVertexToRow(Vertex vertex, int rowIndex, Vector<Vector<Vertex>> rowVector) {
-        Vector<Vertex> rowsVertices = null;
-        // If there is no vector of vertices already created for this row,
-        // then create one
-        if (rowVector.size() == rowIndex) {
-            rowVector.add(new Vector<Vertex>(10, 10));
-        }
-        // Add the vertex to the row's vector of vertices
-        rowsVertices = rowVector.elementAt(rowIndex);
-        rowsVertices.add(vertex);
-    }
-
-    private static void calculateRowMidPoints(Vector<Vector<Vertex>> rowVector, int[] midPoints, IntegerWrapper valueOfLargestMidPoint) {
-        Vector<Vertex> rowsVertices = null;
-        int rowsWidth = 0;
-        int i = 0;
-        for (i = 0; i < midPoints.length; i++) {
-            rowsVertices = rowVector.elementAt(i);
-            rowsWidth = mHorzGap * (rowsVertices.size() - 1);
-            midPoints[i] = rowsWidth / 2;
-            if (midPoints[i] > valueOfLargestMidPoint.mValue) {
-                valueOfLargestMidPoint.mValue = midPoints[i];
-            }
-        }
-    }
-
-    private static void fillInVertexLocations(GraphModel graphModel, Vector<Vector<Vertex>> rowVector,
-        IntegerWrapper valueOfLargestMidPoint, int[] midPoints) {
-            Vector<Vertex> rowsVertices = null;
-            Vertex vertex = null;
-            int rowIndex = 0;
-            int column = 0;
-            int rowsLeftMargin = 0;
-            GraphPoint point = new GraphPoint(0, 0);
-            for (rowIndex = 0; rowIndex < rowVector.size(); rowIndex++) {
-                rowsVertices = rowVector.elementAt(rowIndex);
-                rowsLeftMargin = mLeftMargin + valueOfLargestMidPoint.mValue - midPoints[rowIndex];
-                for (column = 0; column < rowsVertices.size(); column++) {
-                    vertex = rowsVertices.elementAt(column);
-                    point.x = rowsLeftMargin + column * mHorzGap;
-                    point.y = mTopMargin + rowIndex * mVertGap;
-                    vertex.moveAbsolute(point);
-                    graphModel.checkSize(vertex);
-                }
-            }
-    }
-
-    private static void fillInEdgeLocations(GraphModel graphModel) {
-        Vertex[] vertices = graphModel.getVertices();
-        GraphPoint centrePoint = null;
-        DirectedEdge[] inEdges = null;
-        DirectedEdge[] outEdges = null;
-        int i = 0;
-        int j = 0;
-        for (i = 0; i < vertices.length; i++) {
-            centrePoint = vertices[i].getCentrePoint();
-            inEdges = graphModel.getInEdges(vertices[i]);
-            outEdges = graphModel.getOutEdges(vertices[i]);
-            for (j = 0; j < inEdges.length; j++) {
-                inEdges[j].setTerminusPoint(centrePoint);
-            }
-            for (j = 0; j < outEdges.length; j++) {
-                outEdges[j].setOriginPoint(centrePoint);
-            }
-        }
-    }
-}
diff --git a/source/com/c2kernel/graph/layout/IntegerWrapper.java b/source/com/c2kernel/graph/layout/IntegerWrapper.java
deleted file mode 100755
index aaee858..0000000
--- a/source/com/c2kernel/graph/layout/IntegerWrapper.java
+++ /dev/null
@@ -1,13 +0,0 @@
-package com.c2kernel.graph.layout;
-
-
-public class IntegerWrapper
-{
-	public int mValue = 0;
-
-
-	public IntegerWrapper(int value)
-	{
-		mValue = value;
-	}
-}
-- 
cgit v1.2.3