[MADLIB-1099] Graph - all pairs shortest path grouping

• Type: Improvement
• Status: Closed
• Priority: Major
• Resolution: Fixed
• Fix Version/s: v1.12
• Component/s: Module: Graph
• Assignee: Frank McQuillan
• Reporter: Frank McQuillan
• Created: 05/May/17 23:11
• Updated: 15/Jun/17 21:47
• Resolved: 15/Jun/17 21:47

Description

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

Issue Links

• links to: GitHub Pull Request #136