Package g2601_2700.s2699_modify_graph_edge_weights

Class Solution

java.lang.Object

g2601_2700.s2699_modify_graph_edge_weights.Solution

public class Solution
extends Object

2699 - Modify Graph Edge Weights.<p>Hard</p> <p>You are given an <strong>undirected weighted</strong> <strong>connected</strong> graph containing <code>n</code> nodes labeled from <code>0</code> to <code>n - 1</code>, and an integer array <code>edges</code> where <code>edges[i] = [a_i, b_i, w_i]</code> indicates that there is an edge between nodes <code>a_i</code> and <code>b_i</code> with weight <code>w_i</code>.</p> <p>Some edges have a weight of <code>-1</code> (<code>w_i = -1</code>), while others have a <strong>positive</strong> weight (<code>w_i > 0</code>).</p> <p>Your task is to modify <strong>all edges</strong> with a weight of <code>-1</code> by assigning them <strong>positive integer values</strong> in the range <code>[1, 2 * 10⁹]</code> so that the <strong>shortest distance</strong> between the nodes <code>source</code> and <code>destination</code> becomes equal to an integer <code>target</code>. If there are <strong>multiple</strong> <strong>modifications</strong> that make the shortest distance between <code>source</code> and <code>destination</code> equal to <code>target</code>, any of them will be considered correct.</p> <p>Return <em>an array containing all edges (even unmodified ones) in any order if it is possible to make the shortest distance from</em> <code>source</code> <em>to</em> <code>destination</code> <em>equal to</em> <code>target</code><em>, or an <strong>empty array</strong> if it&rsquo;s impossible.</em></p> <p><strong>Note:</strong> You are not allowed to modify the weights of edges with initial positive weights.</p> <p><strong>Example 1:</strong></p> <p><strong><img src="https://assets.leetcode.com/uploads/2023/04/18/graph.png" alt="" /></strong></p> <p><strong>Input:</strong> n = 5, edges = [[4,1,-1],[2,0,-1],[0,3,-1],[4,3,-1]], source = 0, destination = 1, target = 5</p> <p><strong>Output:</strong> [[4,1,1],[2,0,1],[0,3,3],[4,3,1]]</p> <p><strong>Explanation:</strong> The graph above shows a possible modification to the edges, making the distance from 0 to 1 equal to 5.</p> <p><strong>Example 2:</strong></p> <p><strong><img src="https://assets.leetcode.com/uploads/2023/04/18/graph-2.png" alt="" /></strong></p> <p><strong>Input:</strong> n = 3, edges = [[0,1,-1],[0,2,5]], source = 0, destination = 2, target = 6</p> <p><strong>Output:</strong> []</p> <p><strong>Explanation:</strong> The graph above contains the initial edges. It is not possible to make the distance from 0 to 2 equal to 6 by modifying the edge with weight -1. So, an empty array is returned.</p> <p><strong>Example 3:</strong></p> <p><strong><img src="https://assets.leetcode.com/uploads/2023/04/19/graph-3.png" alt="" /></strong></p> <p><strong>Input:</strong> n = 4, edges = [[1,0,4],[1,2,3],[2,3,5],[0,3,-1]], source = 0, destination = 2, target = 6</p> <p><strong>Output:</strong> [[1,0,4],[1,2,3],[2,3,5],[0,3,1]]</p> <p><strong>Explanation:</strong> The graph above shows a modified graph having the shortest distance from 0 to 2 as 6.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= n <= 100</code></li> <li><code>1 <= edges.length <= n * (n - 1) / 2</code></li> <li><code>edges[i].length == 3</code></li> <li><code>0 <= a_i, b_i< n</code></li> <li><code>w_i = -1 </code>or <code>1 <= w_i<= 10⁷</code></li> <li><code>a_i!= b_i</code></li> <li><code>0 <= source, destination < n</code></li> <li><code>source != destination</code></li> <li><code>1 <= target <= 10⁹</code></li> <li>The graph is connected, and there are no self-loops or repeated edges</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[][]	modifiedGraphEdges(int n, int[][] edges, int source, int destination, int target)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

modifiedGraphEdges

public int[][] modifiedGraphEdges(int n,
 int[][] edges,
 int source,
 int destination,
 int target)