[ https://issues.apache.org/jira/browse/MADLIB-1072?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16051071#comment-16051071 ]
Frank McQuillan commented on MADLIB-1072: ----------------------------------------- pls refer to https://github.com/apache/incubator-madlib/pull/136 > Graph - all pairs shortest path > ------------------------------- > > Key: MADLIB-1072 > URL: https://issues.apache.org/jira/browse/MADLIB-1072 > Project: Apache MADlib > Issue Type: New Feature > Components: Module: Graph > Reporter: Frank McQuillan > Assignee: Orhan Kislal > Fix For: v1.12 > > > Story > As a MADlib developer, I want to implement all pairs shortest path in an > efficient and scaleable manner. > Acceptance > 1) Interface defined > 2) Design document updated > 3) Documentation and on-line help > 4) IC and functional tests > 5) Scale tests > Refs > [1] Floyd-Warshall is one possible implemention > https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm > [2] All-Pairs Shortest Paths with Real Weights in O(n3/ logn) Time > https://pdfs.semanticscholar.org/82fc/17e993f4bca9efd468b5087d9d02c8ca5f6d.pdf -- This message was sent by Atlassian JIRA (v6.4.14#64029)