[SOLVED] algorithm Java Spark graph Spark: Single-Source Shortest Path

Spark: Single-Source Shortest Path

(https://i1.wp.com/algorithms.tutorialhorizon.com/files/2018/03/Weighted-Graph.png?ssl=1)
144Node1-> Node3 -> Node4

STARTING_NODE = N1

tips

1
Spark CoreGraphX
()
txt{zid}_output.txt
3:
N0
(https://github.com/mysilver/COMP9313/blob/master/graph.txt) , (https://github.com/mysilver/COMP9313/blob/master/shortest-pathes) .

graph:

N0,N1,4
N0,N2,3
N1,N2,2
N1,N3,2
N2,N3,7
N3,N4,2
N4,N0,4
N4,N1,4
N4,N5,6

::
N2,3,N0-N2
N1,4,N0-N1
N3,6,N0-N1-N3

2019/11/18 17:59

Project
Sparkproject
eclipseJava Project
Spark-Core.jar https://www.dropbox.com/s/xragkjaio6n9onp/Spark-Core.jar?dl=0
(https://www.dropbox.com/s/xragkjaio6n9onp/Spark-Core.jar?dl=0)
projectprojectnext: Build Path > Add External archives

project
()AssigTwo{zid}.java5

CSE/
$ javac -cp .:Spark-Core.jar AssigTwo{zid}.java
$ java -cp .:Spark-Core.jar AssigTwo{zid} STARTING_NODE INPUT_PATH OUTPUT_PATH

CSEgive
$ give cs9313 assig2 AssigTwo{zid}.java
zid{zid}

WebCMSGive
https://cgi.cse.unsw.edu.au/~give/Student/give.php (https://cgi.cse.unsw.edu.au/~give/Student/give.php)
(Maisie Badami, [email protected] (mailto:[email protected]))

()(25):
1. Apache Spark Core(12)
2(3)

N2,3,N0-N2
N1,4,N0-N1
3.() (4)
4. CSE(2)
5. (300)(4)

10%30%