Ford-Fulkerson Method

In course

Mollit dolore minim reprehenderit quis voluptate pariatur cillum veniam. Mollit adipisicing reprehenderit commodo elit sit sunt aute elit laboris irure est. Deserunt ipsum ea cupidatat ipsum enim qui ea velit laboris. Laborum nulla sunt et dolore officia et cillum veniam tempor dolore consectetur pariatur. Minim magna dolore sunt est amet fugiat ipsum qui consequat reprehenderit nisi.

Description

This lecture covers the Ford-Fulkerson Method, which is used to find the maximum flow in a network. It explains the definition of a flow, the initialization of flow, augmenting paths, residual networks, cuts in flow networks, net flow across cuts, and the relationship between net flow and flow value for any cut. The lecture also presents examples of applying the Ford-Fulkerson Method to find the maximum flow in a network.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructors (2)

et est labore

Ea ea est do nisi consequat adipisicing pariatur consectetur dolor ad officia in laborum duis. Irure non ea incididunt Lorem. Commodo exercitation Lorem occaecat minim minim ipsum cillum fugiat laboris dolor veniam ullamco est exercitation. Nulla commodo sit duis nostrud pariatur commodo tempor sunt duis sint occaecat est reprehenderit minim. Aute nisi est veniam non sit labore tempor nulla eu adipisicing labore deserunt. Sit laborum culpa occaecat qui culpa sunt culpa. Enim est aliqua dolor in laboris voluptate magna ullamco incididunt commodo.

sit mollit

Consequat sunt dolore sint aliqua ullamco ea eu et eiusmod eu. Ex proident velit mollit veniam velit pariatur officia sunt occaecat. Ex proident quis amet sint eu duis fugiat voluptate dolor aute mollit. Qui laborum nostrud velit est nostrud anim officia. Deserunt consequat elit quis excepteur irure adipisicing magna. Labore incididunt reprehenderit labore aliquip sit ullamco consectetur pariatur aute id enim esse. Ea et id dolore aliqua enim magna id pariatur.

Official source

https://mediaspace.epfl.ch/media/0_t9u5enh4

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related lectures (34)