hadoop

COMP9313 2018s1 Project 2 Problem statement – single target shortest path: Given a graph and a node “t”, find the shortest distances of all nodes to “t” together with the paths. For example, the shortest distance from node 1 to t is 7 with path 1->3->4->t. Please note that this is different from the single-

COMP9313 2018s1 Project 1 (10 marks) Problem statement: Given a directed graph, compute the average length of the in-coming edges for each node. Input files: In the input file, each line is in format of: “EdgeId FromNodeId ToNodeId Distance”. In the above example, the input is like: 0 0 1 10.0 1 0 2 5.0