Practice Find Edges in Shortest Paths
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Find Edges in Shortest Paths
Problem Statement
You are given an undirected weighted graph of n nodes numbered from 0 to n - 1. The graph consists of m edges represented by a 2D array edges, where edges[i] = [ai, bi, wi] indicates that there is an edge between nodes ai and bi with weight wi. Consider all the shortest paths from node 0 to node n - 1 in the graph. You need to find a boolean array answer where answer[i] is true if the edge edges[i] is part of at least one shortest path. Otherwise, answer[i] is false. Return the array answer. Note that the graph may not be connected.
Source: Find Edges in Shortest Paths on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
n = 6, edges = [[0,1,4],[0,2,1],[1,3,2],[1,4,3],[1,5,1],[2,3,1],[3,5,3],[4,5,2]]
[true,true,true,false,true,true,true,false]
# Example 2
n = 4, edges = [[2,0,1],[0,1,1],[0,3,4],[3,2,2]]
[true,false,false,true]
Constraints
Related LeetCode Problems
Practice more problems similar to Find Edges in Shortest Paths.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.