Given a connected, directional graph. Each node is connected to exactly two other nodes. There is weight associated with each edge denoting the cost to reverse its direction. The task is to find the minimum cost to reverse some edges of the graph such that it is possible to go from each node to every other node.
Input: 5 1 2 7 5 1 8 5 4 5 3 4 1 3 2 10 Output: 15 Input: 6 1 5 4 5 3 8 2 4 15 1 6 16 2 3 23 4 6 42 Output: 39
- In order to reach from each node to every other node, the graph must form a ring i.e Direct all edges on it in one of 2 directions either clockwise or anti-clockwise. Let us denote the cost of redirecting all the clockwise edges to anticlockwise direction as cost1 and vice versa as cost2. The answer is clearly the minimum of these two costs.
- Maintain two boolean arrays start and end. The start and end arrays denote whether there is an edge starting from or ending at a given node. Whenever we encounter an edge going from node a to node b, we first check the condition if there is an edge already starting from node a or ending at node b. If there is an edge that satisfying the condition, the edge is in the opposite direction to the edge already present. In this case, we update cost2 and store the edge is the opposite direction. Otherwise, we update the cost1. This way we are able to maintain the costs of both orientations. Finally, print the minimum cost.
Below is the implementation of above approach:
Time Complexity: O(N) where N is number of edges
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- Minimum edges to reverse to make path from a source to a destination
- Minimum Cost of Simple Path between two nodes in a Directed and Weighted Graph
- Dijkstra's shortest path with minimum edges
- Path with minimum XOR sum of edges in a directed graph
- Minimum odd cost path in a matrix
- Minimum Cost Path with Left, Right, Bottom and Up moves allowed
- Minimum cost to connect weighted nodes represented as array
- Minimum cost path from source node to destination node via an intermediate node
- Path with smallest product of edges with weight >= 1
- Path with smallest product of edges with weight > 0
- Shortest path with exactly k edges in a directed and weighted graph
- Shortest path with exactly k edges in a directed and weighted graph | Set 2
- Shortest path in a graph from a source S to destination D with exactly K edges for multiple Queries
- Longest path between any pair of vertices
- Reverse tree path using Queue