Sequential version of the BFS algorithm and data sets are taken from the book Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne
Parallel Breadth-first search algorithm for undirected Graph processing using MapReduce (Apache Spark, Java)
Requirements: JDK 7, Maven, Spark
Configure service parameters in service.properties file.
####Run with IDE
Add the libraries from sequential-libs folder to your classpath.
Clean-install application with Maven
mvn clean install
Start the master node using the following command
spark-class org.apache.spark.deploy.master.Master
Start the slave nodes using the following command
spark-class org.apache.spark.deploy.worker.Worker spark://{masterIp}:7077
Run the main method of a it.unitn.bd.bfs.BfsSpark class
####Run with Spark
Clean-install application with Maven
mvn clean install
Start the master node using the following command
spark-class org.apache.spark.deploy.master.Master
Start the slave nodes using the following command
spark-class org.apache.spark.deploy.worker.Worker spark://{masterIp}:7077
Submit Spark job from the JAR folder
spark-submit BFS-wit-hMapReduce-${version}-jar-with-dependencies.jar