In mathematics, a dicut is a set of edges in a directed graph, defined from a partition of the vertices into two subsets, so that each edge that has an endpoint in both subsets is directed from the first subset to the second. This is analogous to a cut in undirected graphs. Each strongly connected component of the graph must be entirely contained in one of the two subsets, so a strongly connected graph has no nontrivial dicuts. Often, the underlying directed graph is assumed to be weakly connected; if not, the empty edge set would correspond to multiple vertex partitions.