GitHub user njayaram2 opened a pull request:
https://github.com/apache/incubator-madlib/pull/155
Feature: Weakly connected components helper functions
JIRA: MADLIB-1101
Add several helper functions that will quickly return back various
useful stats based on the connected components learng from the
madlib.weakly_connected_components() function. Five helper functions
are added as part of this story, along with docs and updated install
check. The helper functions are:
- graph_wcc_largest_cpt(): finds largest components
- graph_wcc_histogram(): finds number of vertices in each component
- graph_wcc_vertex_check(): finds all components that have a given
pair of vertices in them.
- graph_wcc_num_cpts(): finds total number of components.
- graph_wcc_reachable_vertices(): finds all vertices reachable
within a component for a given source vertex.
All these functions are implemented to handle grouping columns too
if the WCC's output table was created with grouping_cols.
Closes #155
You can merge this pull request into a Git repository by running:
$ git pull https://github.com/njayaram2/incubator-madlib features/wcc_helper
Alternatively you can review and apply these changes as the patch at:
https://github.com/apache/incubator-madlib/pull/155.patch
To close this pull request, make a commit to your master/trunk branch
with (at least) the following in the commit message:
This closes #155
----
commit 85e89ef1857ed432f295991a6037aa5732714911
Author: Nandish Jayaram <[email protected]>
Date: 2017-07-18T16:31:09Z
Feature: Weakly connected components helper functions
JIRA: MADLIB-1101
Add several helper functions that will quickly return back various
useful stats based on the connected components learng from the
madlib.weakly_connected_components() function. Five helper functions
are added as part of this story, along with docs and updated install
check. The helper functions are:
- graph_wcc_largest_cpt(): finds largest components
- graph_wcc_histogram(): finds number of vertices in each component
- graph_wcc_vertex_check(): finds all components that have a given
pair of vertices in them.
- graph_wcc_num_cpts(): finds total number of components.
- graph_wcc_reachable_vertices(): finds all vertices reachable
within a component for a given source vertex.
All these functions are implemented to handle grouping columns too
if the WCC's output table was created with grouping_cols.
Closes #155
----
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---
