2699. Modify Graph Edge Weights

[mah-shamim]

Topics: Graph, Heap (Priority Queue), Shortest Path

You are given an undirected weighted connected graph containing n nodes labeled from 0 to n - 1, and an integer array edges where edges[i] = [ai, bi, wi] indicates that there is an edge between nodes ai and bi with weight wi.

Some edges have a weight of -1 (wi = -1), while others have a positive weight (wi > 0).

Your task is to modify all edges with a weight of -1 by assigning them positive integer values in the range [1, 2 * 109] so that the shortest distance between the nodes source and destination becomes equal to an integer target. If there are multiple modifications that make the shortest distance between source and destination equal to target, any of them will be considered correct.

Return an array containing all edges (even unmodified ones) in any order if it is possible to make the shortest distance from source to destination equal to target, or an empty array if it's impossible.

Note: You are not allowed to modify the weights of edges with initial positive weights.

Example 1:

• Input: n = 5, edges = [[4,1,-1],[2,0,-1],[0,3,-1],[4,3,-1]], source = 0, destination = 1, target = 5
• Output: [[4,1,1],[2,0,1],[0,3,3],[4,3,1]]
• Explanation: The graph above shows a possible modification to the edges, making the distance from 0 to 1 equal to 5.

Example 2:

• Input: n = 3, edges = [[0,1,-1],[0,2,5]], source = 0, destination = 2, target = 6
• Output: []
• Explanation: 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.

Example 3:

• Input: n = 4, edges = [[1,0,4],[1,2,3],[2,3,5],[0,3,-1]], source = 0, destination = 2, target = 6
• Output: [[1,0,4],[1,2,3],[2,3,5],[0,3,1]]
• Explanation: The graph above shows a modified graph having the shortest distance from 0 to 2 as 6.

Constraints:

• 1 <= n <= 100
• 1 <= edges.length <= n * (n - 1) / 2
• edges[i].length == 3
• 0 <= ai, bi < n
• wi = -1 or 1 <= wi <= 107
• ai != bi
• 0 <= source, destination < n
• source != destination
• 1 <= target <= 109
• The graph is connected, and there are no self-loops or repeated edges

Hint:

1. Firstly, check that it’s actually possible to make the shortest path from source to destination equal to the target.
2. If the shortest path from source to destination without the edges to be modified, is less than the target, then it is not possible.
3. If the shortest path from source to destination including the edges to be modified and assigning them a temporary weight of 1, is greater than the target, then it is also not possible.
4. Suppose we can find a modifiable edge (u, v) such that the length of the shortest path from source to u (dis1) plus the length of the shortest path from v to destination (dis2) is less than target (dis1 + dis2 < target), then we can change its weight to “target - dis1 - dis2”.
5. For all the other edges that still have the weight “-1”, change the weights into sufficient large number (target, target + 1 or 200000000 etc.).

[topugit]

We can break down the approach as follows:

Approach:

1. Initial Check with Existing Weights:

   • First, we compute the shortest path from source to destination using only the edges with positive weights, ignoring the edges with weight -1.
   • If this distance is already greater than target, then it's impossible to modify the -1 edges to achieve the target, so we return an empty array.

2. Temporary Assignment of Weight 1:

   • Next, assign a temporary weight of 1 to all edges with weight -1 and recompute the shortest path.
   • If this shortest path is still greater than target, then it's impossible to achieve the target, so we return an empty array.

3. Modify Specific Edge Weights:

   • Iterate through the edges with weight -1 and identify edges that can be adjusted to exactly match the target distance. This is done by adjusting the weight of an edge such that the combined distances of paths leading to and from this edge result in the exact target distance.
   • For any remaining -1 edges, assign a large enough weight (e.g., 2 * 10^9) to ensure they don't impact the shortest path.

4. Return Modified Edges:

   • Finally, return the modified list of edges.

Let's implement this solution in PHP: 2699. Modify Graph Edge Weights

<?php
private $kMax = 2000000000;

 /**
  * @param $n
  * @param $edges
  * @param $source
  * @param $destination
  * @param $target
  * @return array|mixed
  */
 function modifiedGraphEdges($n, $edges, $source, $destination, $target) {
     $graph = array_fill(0, $n, []);

     // Build the graph
     foreach ($edges as $edge) {
         list($u, $v, $w) = $edge;
         if ($w == -1) continue;
         $graph[$u][] = [$v, $w];
         $graph[$v][] = [$u, $w];
     }

     // Calculate distance from source to destination
     $distToDestination = dijkstra($graph, $source, $destination);
     if ($distToDestination < $target) return [];
     if ($distToDestination == $target) {
         // Change the weights of negative edges to an impossible value
         foreach ($edges as &$edge) {
             if ($edge[2] == -1) {
                 $edge[2] = $this->kMax;
             }
         }
         return $edges;
     }

     // Modify the graph and adjust weights
     for ($i = 0; $i < count($edges); ++$i) {
         list($u, $v, $w) = $edges[$i];
         if ($w != -1) continue;
         $edges[$i][2] = 1;
         $graph[$u][] = [$v, 1];
         $graph[$v][] = [$u, 1];
         $distToDestination = dijkstra($graph, $source, $destination);
         if ($distToDestination <= $target) {
             $edges[$i][2] += $target - $distToDestination;
             // Change the weights of negative edges to an impossible value
             for ($j = $i + 1; $j < count($edges); ++$j) {
                 if ($edges[$j][2] == -1) {
                     $edges[$j][2] = $this->kMax;
                 }
             }
             return $edges;
         }
     }

     return [];
 }

 /**
  * @param $graph
  * @param $src
  * @param $dst
  * @return int|mixed
  */
 function dijkstra($graph, $src, $dst) {
     $dist = array_fill(0, count($graph), PHP_INT_MAX);
     $minHeap = new SplPriorityQueue();
     $minHeap->setExtractFlags(SplPriorityQueue::EXTR_BOTH);

     $dist[$src] = 0;
     $minHeap->insert($src, 0);

     while (!$minHeap->isEmpty()) {
         $node = $minHeap->extract();
         $u = $node['data'];
         $d = -$node['priority'];

         if ($d > $dist[$u]) continue;

         foreach ($graph[$u] as list($v, $w)) {
             if ($d + $w < $dist[$v]) {
                 $dist[$v] = $d + $w;
                 $minHeap->insert($v, -$dist[$v]);
             }
         }
     }

     return $dist[$dst];
 }


// Example usage:

// Example 1
$n = 5;
$edges = [[4,1,-1],[2,0,-1],[0,3,-1],[4,3,-1]];
$source = 0;
$destination = 1;
$target = 5;
print_r(modifyGraphEdgeWeights($n, $edges, $source, $destination, $target)); // Output: [[4,1,1],[2,0,1],[0,3,3],[4,3,1]]

// Example 2
$n = 3;
$edges = [[0,1,-1],[0,2,5]];
$source = 0;
$destination = 2;
$target = 6;
print_r(modifyGraphEdgeWeights($n, $edges, $source, $destination, $target)); // Output: []

// Example 3
$n = 4;
$edges = [[1,0,4],[1,2,3],[2,3,5],[0,3,-1]];
$source = 0;
$destination = 2;
$target = 6;
print_r(modifyGraphEdgeWeights($n, $edges, $source, $destination, $target));  // Output: [[1,0,4],[1,2,3],[2,3,5],[0,3,1]]
?>

Explanation:

• The dijkstra function calculates the shortest path from the source to all other nodes.
• We initially compute the shortest path ignoring -1 edges.
• If the path without -1 edges is less than the target, the function returns an empty array, indicating it's impossible to adjust the weights to meet the target.
• Otherwise, we temporarily set all -1 edges to 1 and check if the shortest path exceeds the target.
• If it does, it's again impossible to reach the target, and we return an empty array.
• We then modify the weights of -1 edges strategically to achieve the desired shortest path of exactly target.

This approach efficiently checks and adjusts edge weights, ensuring that the target distance is met if possible.

[mah-shamim]

Thanks to solve the problem of modifying the edge weights to match the target distance between the source and destination

[topugit]

Thanks