What is a flow in a graph? What is a cut? How do they relate? Describe some ideas around these two concepts.
Contents
What is a flow in a graph?
Useful in coding, flow graph is a visual representation of the various paths the code of a computer program can take. Flow in a graph is depicted using a series of arrows and nodes that display the route one can travel to each node. Each node represents a particular line of code in a program.
Here is a simple example of a flow graph:
- Node 1 is the initial line of code.
- Depending on the outcome of node 1, the code will flow ether to node 2 or node 7.
- The code will continue until the flow has reached the destination node (i.e. node 6), following the flow of the graph throughout.
* This can be properly illustrated in code by using if statements.
(http://en.wikipedia.org/wiki/Max-flow_min-cut_theorem)
In order to get a hands on approach, here is another example from youtube, http://www.youtube.com/watch?v=7jFoyLk2VjM
One of the primary purposes of creating a control flow graph is to discover whether there are parts of a computer program that are unnecessary. This can be achieved easily when looking at the control flow diagram. Any node that does not have an arrow connecting it to the rest of the nodes can be removed.
Another purpose a control flow graph serves is to help isolate problems such as infinite loops, where program execution does not move beyond a single node. Each arrow on the diagram shows what condition must be met to move to the node to which it points, so situations where that condition is never met can be spotted, because it causes the program to cycle back to the previous node over and over.
Finally, a control flow graph can help to create a program dependence graph. This type of graph shows what areas of a program are reliant on other parts. In computer science, this is used to establish an evaluation order to ensure that program code is executing in the correct sequence.
The visual nature of a control flow graph is one of the features that can make it potentially invaluable. Pieces of code that are never directly called or accessed will be fairly obvious, because there will either be no arrows linking it to the main program or the conditions will show that they can never be met to reach the code. There are computer programs that can automatically generate a control flow graph based on a series of source code files, further simplifying the process.
A control flow graph can be represented in any number of ways and, therefore, might appear differently depending on who has produced it. Some graphs use circles or squares exclusively to represent nodes while others use the same shapes as a standard flowchart . Although they are read in the exact same way, the method chosen is purely personal preference.
In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets that are joined by at least one edge. The cut-set of the cut is the set of edges whose end points are in different subsets of the partition. Edges are said to be crossing the cut if they are in its cut-set. (Many graph theorists use the term cut to refer to the edge set instead of the vertex partition.)
In an unweighted undirected graph, the size or weight of a cut is the number of edges crossing the cut. In a weighted graph, the same term is defined by the sum of the weights of the edges crossing the cut.
In a flow network, an s-t cut is a cut that requires the source and the sink to be in different subsets, and its cut-set only consists of edges going from the source's side to the sink's side. The capacity of an s-t cut is defined as the sum of capacity of each edge in the cut-set.
Definition
A cut is a partition of of a graph . An s-t cut of a network is a cut of such that and , where and are the source and the sink of respectively. The cut-set of a cut is the set . The size of a cut is the number of edges in the cut-set. If the edges are weighted, the value (or weight) of the cut is the sum of the weights. A bond is a cut-set that does not have any other cut-set as a proper subset.
Minimum Cut and Maximum Cut
A cut is minimum if the size of the cut is not larger than the size of any other cut. The max-flow min-cut theorem proves that the maximum network flow and the sum of the cut-edge weights of any minimum cut that separates the source and the sink are equal. There are polynomial-time methods to solve the min-cut problem, notably the Edmonds-Karp algorithm.
A cut is maximum if the size of the cut is not smaller than the size of any other cut.
Finding a max cut can be more difficult than finding a minimum cut conceptually.
Note that min-cut and max-cut are not dual problems in the linear programming sense, even though one gets from one problem to other by changing min to max in the objective function. The max-flow problem is the dual of the min-cut problem.
Cut space
The family of all cut sets of an undirected graph where there is no more room fro an expansion in capacity is known as the cut space of the graph. It forms a vector over the network, with the symmetric difference of two cut sets as the vector addition operation, and is the orthogonal complement of the cycle space. If the edges of the graph are given positive weights, the minimum capacity of the cut space can be described by a tree on the same vertex set as the graph, called the Gomory–Hu tree. Each edge of this tree is related to a bond in the original graph, and the minimum cut between two nodes s and t is the minimum capacity among the ones related with the path from s to t in the tree.
How Do They Relate?
In simple terms, we will get:
MAX FLOW = MIN CUT
Here is a proof from Eugene Lawler to explain this concept...
http://www.wisegeek.com/what-is-a-control-flow-graph.htm http://en.wikipedia.org/wiki/Cut_(graph_theory)
Eugene Lawler (2001). "4.5. Combinatorial Implications of Max-Flow Min-Cut Theorem, 4.6. Linear Programming Interpretation of Max-Flow Min-Cut Theorem". Combinatorial Optimization: Networks and Matroids. Dover. pp. 117–120. ISBN 0-486-41453-1.
