Spark/Scala/GraphX:Breadth First Search Algorithm Identifying Connected Components
Sunday, November 12, 2017
During a security incident scenario,it is highly useful to identify infrastructure components which are directly or indirectly connected infrastructure components and this should be part of Incident response plan.
Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root and explores the neighbor nodes first, before moving to the next level neighbors
A GraphX implementation of the algorithm is implemented as provided in the notebook below