4A,4B

SSSP algorithm for the graph given in the figure. 3C. 2. VS V1 Figure. 3C Input graph for Dijkstra's algorithm Write a Cypher query to find the indegree of all nodes and to find the shortest path from Danapur 4M to New Delhi (Table 5B(b)). 4B. Write a Cypher query to construct an adjacency matrix that contains 999 if there is no edge 4M between two different nodes otherwise the weight of the edge between the nodes. Display the table under the label source, destination and weight for the graph in figure 3C. 4C. Explain the different wrappers used by Giraph to interoperate with Hadoop and Relational data 4A. 2M sources. 5A. Write a Cypher query to return a graph that does not contain the immediate neighborhood of V3 in figure 3C. 5B. Write a GraphX query to create a graph trainGraph, from a list of vertices i.e., the railway station names given in table 5B(a) & a list of edges that will make up the train service from table 5B(b). 4M Table 5B(a) Station Table 5B(b) Source station Station Name Train Destination ID Number station 11177 PUNE JN 12888 NEW DELHI 12800 PURI PUNE JN JAMMU TAWI NEW DELHI PURI PURI NEW DELHI 4. 12200 | BANGALORE CITY JN DANAPUR 12134 PUNE JN 12211 DANAPUR 12136 HOWRAH JN 12347 BANGALORE CITY JN 12576 NEW DELHI BANGALORE CITY JN DANAPUR HOWRAH JN 6. HOWRAH JN BANGALORE CITY JN JAMMU TAWI PUNE JN 8. DARBHANGA JN NEW DELHI DARBHANGA JN C. Write all the necessary GraphX queries to create and join the station information given in tohla 50