Details
-
New Feature
-
Status: Closed
-
Major
-
Resolution: Fixed
-
None
-
None
Description
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/
