[MADLIB-1101] Graph - weakly connected components helper functions

• Type: New Feature
• Status: Closed
• Priority: Major
• Resolution: Fixed
• Fix Version/s: v1.12
• Component/s: Module: Graph
• Assignee: Unassigned
• Reporter: Frank McQuillan
• Created: 11/May/17 20:02
• Updated: 28/Jul/17 20:40
• Resolved: 27/Jul/17 17:13

Description

Context

Follow on from
https://issues.apache.org/jira/browse/MADLIB-1071

Story

As a data scientist, I want to use helper functions related to weakly connected components, so that I don't have to query the result table myself which is less efficient and subject to error.

List of helper functions roughly in priority order:

1) biggest connected component
2) number of nodes per connected component (histogram)
3) whether two nodes belong to same or different connected components

4) count of connected cpt clusters
5) Set of all nodes which can be reached (have a path) from a specified vertex

Issue Links

• links to: GitHub Pull Request #155