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

ASF GitHub Bot commented on MADLIB-1099:
----------------------------------------

GitHub user orhankislal opened a pull request:

    https://github.com/apache/incubator-madlib/pull/136

    Graph: Add APSP with grouping

    JIRA: MADLIB-1099
    
    - Add all pairs shortest path algorithm with grouping support.
    This algorithm provides the minimum cost (sum of edge weights) paths for
    every vertex pair in the graph.
    - Add the get path algorithm to find the actual path for any vertex pair
    (with grouping support)
    - Minor changes in SSSP and graph utilities.

You can merge this pull request into a Git repository by running:

    $ git pull https://github.com/orhankislal/incubator-madlib 
graph/apsp_gr_take2

Alternatively you can review and apply these changes as the patch at:

    https://github.com/apache/incubator-madlib/pull/136.patch

To close this pull request, make a commit to your master/trunk branch
with (at least) the following in the commit message:

    This closes #136
    
----
commit b6ce2c8deead3502051d215b937836e19451f8a6
Author: Orhan Kislal <[email protected]>
Date:   2017-05-17T22:29:30Z

    Graph: Add APSP with grouping
    
    JIRA: MADLIB-1099
    
    - Add all pairs shortest path algorithm with grouping support.
    This algorithm provides the minimum cost (sum of edge weights) paths for
    every vertex pair in the graph.
    - Add the get path algorithm to find the actual path for any vertex pair
    (with grouping support)
    - Minor changes in SSSP and graph utilities.

----


> Graph - all pairs shortest path grouping
> ----------------------------------------
>
>                 Key: MADLIB-1099
>                 URL: https://issues.apache.org/jira/browse/MADLIB-1099
>             Project: Apache MADlib
>          Issue Type: Improvement
>          Components: Module: Graph
>            Reporter: Frank McQuillan
>             Fix For: v1.12
>
>
> Story
> As a MADlib developer, I want to implement grouping for all pairs shortest 
> path in an efficient and scaleable manner, so that I can compute other 
> measures that use APSP (eg., centrality measures).
> Acceptance
> 1) Grouping param in interface
> 2) Documentation and on-line help
> 3) IC and Tinc tests
> 4) Scale testing done



--
This message was sent by Atlassian JIRA
(v6.3.15#6346)

Reply via email to