[MADLIB-1072] Graph - all pairs shortest path

• Type: New Feature
• Status: Closed
• Priority: Major
• Resolution: Fixed
• Fix Version/s: v1.12
• Component/s: Module: Graph
• Assignee: Orhan Kislal
• Reporter: Frank McQuillan
• Created: 15/Feb/17 18:25
• Updated: 15/Jun/17 21:15
• Resolved: 15/Jun/17 16:58

Description

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