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

---
 .../c2kernel/graph/traversal/GraphTraversal.java   | 85 ++++++++++++++++++++++
 1 file changed, 85 insertions(+)
 create mode 100644 src/main/java/com/c2kernel/graph/traversal/GraphTraversal.java

(limited to 'src/main/java/com/c2kernel/graph/traversal')

diff --git a/src/main/java/com/c2kernel/graph/traversal/GraphTraversal.java b/src/main/java/com/c2kernel/graph/traversal/GraphTraversal.java
new file mode 100644
index 0000000..0d9c819
--- /dev/null
+++ b/src/main/java/com/c2kernel/graph/traversal/GraphTraversal.java
@@ -0,0 +1,85 @@
+package com.c2kernel.graph.traversal;
+
+
+import java.util.Vector;
+
+import com.c2kernel.graph.model.GraphModel;
+import com.c2kernel.graph.model.Vertex;
+
+
+public class GraphTraversal
+{
+    public static final int kUp   = 1;
+    public static final int kDown = 2;
+
+
+    private GraphTraversal()
+    {
+    }
+
+
+    public static Vertex[] getTraversal(GraphModel graphModel, Vertex startVertex, int direction, boolean ignoreBackLinks)
+    {
+        Vector<Vertex> path = new Vector<Vertex>(10, 10);
+
+        graphModel.clearTags(startVertex);
+        visitVertex(startVertex, graphModel, path, direction, startVertex, ignoreBackLinks);
+
+        return vectorToVertexArray(path);
+    }
+
+
+    private static void visitVertex(Vertex vertex, GraphModel graphModel, Vector<Vertex> path, int direction, Object tag, boolean ignoreBackLinks)
+    {
+        Vertex[] children = null;
+        int i = 0;
+
+        if(direction == kDown)
+        {
+            children = graphModel.getOutVertices(vertex);
+        }
+        else
+        {
+            children = graphModel.getInVertices(vertex);
+        }
+
+        vertex.setTag(tag);
+        path.add(vertex);
+
+        for(i=0; i<children.length; i++)
+        {
+            if(!(children[i].hasTag(tag)))
+            {
+                boolean skipBackLink = false;
+                if ( ignoreBackLinks &&
+                    ((vertex.isJoin() && direction == kUp) ||
+                    (vertex.isLoop() && direction == kDown))) {
+                    Vertex[] following = getTraversal(graphModel, children[i], direction, false);
+                    for (Vertex element : following) {
+                        if (element == vertex) {
+                            skipBackLink = true;
+                            break;
+                        }
+                    }
+                }
+                if (!skipBackLink)
+                    visitVertex(children[i], graphModel, path, direction, tag, ignoreBackLinks);
+            }
+        }
+    }
+
+
+    private static Vertex[] vectorToVertexArray(Vector<Vertex> vector)
+    {
+        Vertex[] vertices = new Vertex[vector.size()];
+        int      i        = 0;
+
+
+        for(i=0; i<vertices.length; i++)
+        {
+            vertices[i] = vector.elementAt(i);
+        }
+
+        return vertices;
+    }
+}
-- 
cgit v1.2.3