Expedia Group interview question

Complete the function classifyEdges in editor. The function must return an array of g_edges strings where the value at the ith index is YES if the ith edge is a part of the shortest path from vertex 1 to vertex g_nodes. Otherwise, it should contain NO. # The function is expected to return a STRING_ARRAY. # The function accepts WEIGHTED_INTEGER_GRAPH g as parameter. # # # For the weighted graph, <name>: # # 1. The number of nodes is <name>_nodes. # 2. The number of edges is <name>_edges. # 3. An edge exists between <name>_from[i] and <name>_to[i]. The weight of the edge is <name>_weight[i]. # # def classifyEdges(g_nodes, g_from, g_to, g_weight):