Flow Problems (VCE SSCE General Mathematics): Flashcards
📚Flashcards
Practise the cards
10 cards from this deck
ShowHide
Practise the cards
10 cards from this deck
Directed graph (digraph)
Directed graph (digraph)
Graph using arrows on edges to show direction of flow
Network in graph theory
Network in graph theory
Graph with numerical information on edges
Source in flow network
Source in flow network
Starting point where flow begins
Sink in flow network
Sink in flow network
Destination where flow ends
Capacity of an edge
Capacity of an edge
Maximum amount that can flow through it in given time
Bottleneck principle
Bottleneck principle
Max flow in series = min capacity of individual pipes
Cut in flow network
Cut in flow network
Imaginary line completely separating source from sink
How to calculate cut capacity
How to calculate cut capacity
Sum capacities of edges from source side to sink side only
Maximum-flow minimum-cut theorem
Maximum-flow minimum-cut theorem
Min cut capacity equals max flow through network
Vertices in graph theory
Vertices in graph theory
Points or nodes in network