[
https://issues.apache.org/jira/browse/MADLIB-1101?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16102428#comment-16102428
]
Nandish Jayaram commented on MADLIB-1101:
-----------------------------------------
Proposed interfaces:
1) biggest connected component
{code}
madlib.graph_wcc_largest_cpt(...)
{code}
If more than one cpt is the largest, report back all of them
2) number of nodes per connected component (histogram)
{code}
madlib.graph_wcc_histogram(...)
{code}
3) whether two nodes belong to same or different connected components
{code}
madlib.graph_wcc_vertex_check(...)
{code}
4) count of connected cpts
{code}
madlib.graph_wcc_num_cpts(...)
{code}
5) Set of all nodes which can be reached (have a path) from a specified vertex
{code}
madlib.graph_wcc_reachable_vertices(...)
{code}
> Graph - weakly connected components helper functions
> ----------------------------------------------------
>
> Key: MADLIB-1101
> URL: https://issues.apache.org/jira/browse/MADLIB-1101
> Project: Apache MADlib
> Issue Type: New Feature
> Components: Module: Graph
> Reporter: Frank McQuillan
> Fix For: v1.12
>
>
> 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
--
This message was sent by Atlassian JIRA
(v6.4.14#64029)
