commit 4d8c02dfe878aac692e13e97054a2d7b6b7c3148
author manuzhang <owenzhang1990@gmail.com> Fri Mar 03 21:07:28 2017 +0800
committer manuzhang <owenzhang1990@gmail.com> Fri Mar 03 21:07:37 2017 +0800
tree 36cf7c04a80c046be8e50dd0e79ca8d3395b0bf5
parent 07d8d51e7f0ce39564aeb919a61cee35845deacc

[GEARPUMP-288] Skip getAcyclicCopy on acyclic graph

Author: manuzhang <owenzhang1990@gmail.com>

Closes #166 from manuzhang/GEARPUMP-288.

core/src/main/scala/org/apache/gearpump/util/Graph.scala

diff --git a/core/src/main/scala/org/apache/gearpump/util/Graph.scala b/core/src/main/scala/org/apache/gearpump/util/Graph.scala
index 2ea552c..609b133 100644
--- a/core/src/main/scala/org/apache/gearpump/util/Graph.scala
+++ b/core/src/main/scala/org/apache/gearpump/util/Graph.scala
@@ -318,8 +318,12 @@
    * http://www.drdobbs.com/database/topological-sorting/184410262
    */
   def topologicalOrderWithCirclesIterator: Iterator[N] = {
-    val topo = getAcyclicCopy().topologicalOrderIterator
-    topo.flatMap(_.sortBy(_indexs(_)).iterator)
+    if (hasCycle()) {
+      val topo = getAcyclicCopy().topologicalOrderIterator
+      topo.flatMap(_.sortBy(_indexs(_)).iterator)
+    } else {
+      topologicalOrderIterator
+    }
   }
 
   private def getAcyclicCopy(): Graph[mutable.MutableList[N], E] = {