Let's now perform the initial execution of this algorithm on our starting representation of the graph:
graph.txt
file onto HDFS:$ hadoop fs -mkdirgraphin $ hadoop fs -put graph.txtgraphin/graph.txt
$ javac GraphPath.java $ jar -cvf graph.jar *.class
$ hadoop jar graph.jarGraphPathgraphingraphout1
$ hadoop fs –cat /home/user/hadoop/graphout1/part-r00000 12,3,40D 21,41C 31,5,61C 41,21C 53,6-1P 63,5-1P 76-1P
After putting the source file onto HDFS and creating the job JAR file, we executed the job in Hadoop. The output representation of the graph shows a few changes, as follows:
Our graph now looks like the following figure:
Given the algorithm, this is to be expected; the first node is complete and its neighboring nodes, extracted through the mapper, are in progress. All other nodes are yet to begin processing.
18.118.28.179