edges[i] = [ai, bi, wi]indicates that there is an edge between nodesaiandbiwith weightwi`.

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.

Examples

Example 1

 
![](https://assets.leetcode.com/uploads/2024/03/05/graph35drawio-1.png)

Related Tags