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
- Minimum edges to reverse to make path from a source to a destination
- Dijkstra's shortest path with minimum edges
- 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
- Shortest path with exactly k edges in a directed and weighted graph
- Longest path between any pair of vertices
- Reverse tree path using Queue
- Minimum number of edges between two vertices of a graph using DFS
- Minimum number of edges between two vertices of a Graph
- Minimum edges required to add to make Euler Circuit
- Remove all outgoing edges except edge with minimum weight
- Minimum number of edges that need to be added to form a triangle
- Find the minimum spanning tree with alternating colored edges
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.