Frank McQuillan created MADLIB-1072:
---------------------------------------
Summary: 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
Fix For: v1.11
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
--
This message was sent by Atlassian JIRA
(v6.3.15#6346)
