Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
21 views2 pages

Network Flow Assignment

The document outlines key concepts in network flow, including digraphs, weighted graphs, maximum flow, the Max-Flow Min-Cut Theorem, and the Ford-Fulkerson Algorithm. It explains the definitions and importance of each concept, illustrating how they apply to real-world scenarios like traffic and internet routing. Additionally, it provides a summary table and references for further reading.

Uploaded by

tayyab69188235
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
21 views2 pages

Network Flow Assignment

The document outlines key concepts in network flow, including digraphs, weighted graphs, maximum flow, the Max-Flow Min-Cut Theorem, and the Ford-Fulkerson Algorithm. It explains the definitions and importance of each concept, illustrating how they apply to real-world scenarios like traffic and internet routing. Additionally, it provides a summary table and references for further reading.

Uploaded by

tayyab69188235
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Key Concepts in Network Flow

1. Digraph (Directed Graph)


Definition:
A digraph (directed graph) is a graph where each edge has a direction, represented by an
arrow (→). This means flow is allowed only in the specified direction.

Example:
s→A→B→t
Flow can go from 's' to 't' in that direction only.

Importance:
Digraphs are used to represent real-world direction-based networks such as traffic or
internet routing.

2. Weighted Graph
Definition:
A weighted graph is a graph where each edge has a numeric value (weight), representing
capacity in a flow network.

Example:
A → B (Capacity: 10)

Importance:
Weighted graphs model systems with constraints like bandwidth, road capacity, etc.

3. Maximum Flow
Definition:
Maximum flow is the highest amount of flow that can be sent from a source node (s) to a
sink node (t) without exceeding edge capacities.

Example:
Path 1: 10 units, Path 2: 5 units → Maximum Flow = 15 units.

4. Max-Flow Min-Cut Theorem


Definition:
This theorem states that the maximum flow from source to sink is equal to the minimum
total capacity of edges that, if removed, would disconnect the source from the sink.
Importance:
It proves that the maximum flow found is optimal.

5. Ford-Fulkerson Algorithm
Steps:
1. Start with 0 flow on all edges.
2. Find an augmenting path.
3. Send minimum capacity flow through it.
4. Update flows and reverse edges.
5. Repeat until no more paths are available.

Result:
Total flow = Maximum flow.

Summary Table
Digraph – Flow has direction
Weighted Graph – Edges have capacity
Maximum Flow – Highest flow possible
Max-Flow Min-Cut – Max flow = min cut capacity
Ford-Fulkerson – Algorithm to find max flow

References
1. Bondy & Murty – Graph Theory with Applications
2. R. Diestel – Graph Theory
3. Rosen – Discrete Mathematics and Its Applications

You might also like