Mailing-List: contact dev-help@gearpump.incubator.apache.org; run by ezmlm
Precedence: bulk
Reply-To: dev@gearpump.incubator.apache.org
Date: Fri, 15 Sep 2017 04:26:00 +0000 (UTC)
From: "ASF GitHub Bot (JIRA)" <jira@apache.org>
To: dev@gearpump.incubator.apache.org
Message-ID: <JIRA.13099591.1504525572000.119659.1505449560170@Atlassian.JIRA>
In-Reply-To: <JIRA.13099591.1504525572000@Atlassian.JIRA>
References: <JIRA.13099591.1504525572000@Atlassian.JIRA> <JIRA.13099591.1504525572778@jira-lw-us.apache.org>
Subject: [jira] [Commented] (GEARPUMP-349) Graph#topologicalOrderIterator is
 slow for large graph
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8
Content-Transfer-Encoding: 7bit
archived-at: Fri, 15 Sep 2017 04:26:06 -0000


    [ https://issues.apache.org/jira/browse/GEARPUMP-349?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16167307#comment-16167307 ] 

ASF GitHub Bot commented on GEARPUMP-349:
-----------------------------------------

Github user manuzhang commented on a diff in the pull request:

    https://github.com/apache/incubator-gearpump/pull/223#discussion_r139061587
  
    --- Diff: core/src/main/scala/org/apache/gearpump/util/Graph.scala ---
    @@ -243,13 +258,36 @@ class Graph[N, E](vertexList: List[N], edgeList: List[(N, E, N)]) extends Serial
        * The node returned by Iterator is stable sorted.
        */
       def topologicalOrderIterator: Iterator[N] = {
    -    val newGraph = copy
    -    var output = List.empty[N]
    +    tryTopologicalOrderIterator match {
    +      case Success(intertor) => intertor
    --- End diff --
    
    intertor ?


> Graph#topologicalOrderIterator is slow for large graph
> ------------------------------------------------------
>
>                 Key: GEARPUMP-349
>                 URL: https://issues.apache.org/jira/browse/GEARPUMP-349
>             Project: Apache Gearpump
>          Issue Type: Improvement
>          Components: core
>    Affects Versions: 0.8.4
>            Reporter: Manu Zhang
>            Assignee: Huafeng Wang
>             Fix For: 0.8.5
>
>
> The algorithm is as follows
> 1. find zero in-degree nodes from a copied graph. 
> 2. remove nodes from the copied graph and add them to the output
> 3. repeat 1
> The issue is that step 1 traverses all remaining nodes each time, which costs the algorithm {{O(n^2)}} time
> {{Graph#hasCycle}} has a similar issue


--
This message was sent by Atlassian JIRA
(v6.4.14#64029)