Search the forum,

cut

In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. Any cut determines a cut-set, the set of edges that have one endpoint in each subset of the partition. These edges are said to cross the cut. In a connected graph, each cut-set determines a unique cut, and in some cases cuts are identified with their cut-sets rather than with their vertex partitions.
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 the capacity of each edge in the cut-set.

View More On Wikipedia.org
  • 15

    Dan

    Administrator From On the forum.
    • Messages
      2,780
    • Directory
      6
    • Reaction score
      1,222
    • Points
      113
  • 1

    daylemurray

    From Belfast
    • Messages
      1
    • Reaction score
      0
    • Points
      1
  • 1

    SAB1957

    • Messages
      1
    • Reaction score
      0
    • Points
      1
  • 1

    Russ333

    From Norfolk
    • Messages
      6
    • Reaction score
      0
    • Points
      1
  • 1

    Tinbucket

    From Royston
    • Messages
      1
    • Reaction score
      0
    • Points
      1
  • 1

    macka09

    Plumbers Arms member
    • Messages
      1,226
    • Reaction score
      88
    • Points
      48
  • 1

    seha1997

    From Devon
    • Messages
      1
    • Reaction score
      0
    • Points
      1
  • Creating content since 2001. Untold Media.

    Newest Plumbing Threads

    Back
    Top
    AdBlock Detected

    We get it, advertisements are annoying!

    Sure, ad-blocking software does a great job at blocking ads, but it also blocks useful features of our website. For the best site experience please disable your AdBlocker.

    I've Disabled AdBlock