[
https://issues.apache.org/jira/browse/MADLIB-1102?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16092735#comment-16092735
]
ASF GitHub Bot commented on MADLIB-1102:
----------------------------------------
GitHub user rashmi815 opened a pull request:
https://github.com/apache/incubator-madlib/pull/153
Graph: BFS algorithm design docs
BFS algorithm design docs created.
BFS algorithm already merged on commit
[8c9b955](https://github.com/apache/incubator-madlib/commit/8c9b955cd2e3150ad935ad1581e164670723184f).
BFS algorithm JIRA: MADLIB-1102
You can merge this pull request into a Git repository by running:
$ git pull https://github.com/rashmi815/incubator-madlib master
Alternatively you can review and apply these changes as the patch at:
https://github.com/apache/incubator-madlib/pull/153.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 #153
----
commit a9a02c21b69d3aa8377f3caf62ffed5f900053dd
Author: Rashmi Raghu <[email protected]>
Date: 2017-07-19T07:47:35Z
BFS design docs.
----
> Graph - Breadth First Search / Traversal
> ----------------------------------------
>
> Key: MADLIB-1102
> URL: https://issues.apache.org/jira/browse/MADLIB-1102
> Project: Apache MADlib
> Issue Type: New Feature
> Components: Module: Graph
> Reporter: Rashmi Raghu
> Assignee: Rashmi Raghu
> Fix For: v1.12
>
>
> Story
> As a MADlib user and developer, I want to implement Breadth First Search /
> Traversal for a graph. BFS is also a core part of the connected components
> graph algorithm.
> Accpetance:
> 1) Interface defined
> 2) Design doc updated
> 3) Documentation and on-line help
> 4) IC and functional tests
> 5) Scale tests
> References:
> [0] [https://en.wikipedia.org/wiki/Breadth-first_search]
> "Breadth-first search (BFS) is an algorithm for traversing or searching tree
> or graph data structures. It starts at the tree root (or some arbitrary node
> of a graph, sometimes referred to as a 'search key'[1]) and explores the
> neighbor nodes first, before moving to the next level neighbors."
> [1] [http://www.geeksforgeeks.org/breadth-first-traversal-for-a-graph/]
--
This message was sent by Atlassian JIRA
(v6.4.14#64029)
