5A

SSSP algorithm for the graph given in the figure. 3C. Figure. 3C Input graph for Dijkstra's algorithm 4A. 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)). 3. 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 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 1.e., the railway station SM names given in table 5B(a) & a list of edges that will make up the train service from table 5B(b). Table 5B(a) Table 5B(b) Station Station Name Train Source station Destination Number station PUNE JN 11177 PUNE JN JAMMU TAWI NEW DELHI 12888 NEW DELHI PURI PURI 12800 PURI NEW DELHI BANGALORE CITY JN 12200 BANGALORE CITY JN DANAPUR S DANAPUR 12134 PUNE JN HOWRAH JN HOWRAH JN 12211 DANAPUR BANGALORE CITY JN JAMMU TAWI 12136 HOWRAH JN PUNE JN DARBHANGA JN 12347 BANGALORE CITY IN NEW DELHI 12576 NEW DELHI DARBHANGA JN Write all the necessary GraphX queries to create and join the station information given in alle ID