@

Dark Mode

Profile
Edit my Profile
Messages
My favorites

Register

Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams

Dark Mode

can any1 explain how to find maximum flow in graph from source to sink. pls

indresh asked in Algorithms Jan 25, 2015 retagged Jun 21, 2022 by makhdoom ghaya

447 views

0 votes

0 votes

cormen
graph-algorithms

indresh asked in Algorithms Jan 25, 2015 retagged Jun 21, 2022 by makhdoom ghaya

447 views

0 Comments

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 votes

0 votes

Maximal flow algorithms are in Cormen.

http://en.wikipedia.org/wiki/Maximum_flow_problem

Arjun answered Jan 25, 2015

by Arjun

0 Comments

Please log in or register to add a comment.

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

0 votes

1 answer

1

gate_forum asked in Algorithms Dec 25, 2015

1,088 views

complexity of algo for detection of universal sink in directed graph
minimum running time of algo that determines universal sink in a directed graph G={V,E} - a vertex with indegree |V|-1 and outdegree 0, given an adjacency matrix for G is: omega(V^2) O(V) O(V+E) none

gate_forum asked in Algorithms Dec 25, 2015

1.1k views

time-complexity
graph-algorithms

1 vote

1 vote

2 answers

2

Vishal Upadhayay asked in Algorithms Apr 14, 2017

616 views

Paragraph from Coreman. Can anyone explain me this in simplified manner.
HI i am trying to understand what author is trying to explain in the below para. However i understood the meaning of Theta(n^2) but if anyone can explain me this para in simplified way it will be great help.

Vishal Upadhayay asked in Algorithms Apr 14, 2017

by Vishal Upadhayay

616 views

algorithm-design
cormen
descriptive

0 votes

0 votes

2 answers

3

sushmita asked in Algorithms Dec 1, 2016

1,577 views

cormen chapter 23 third edition.
Given a graph G and a minimum spanning tree T, suppose that we decrease the weight of one of the edges in T. Show that T is still a minimum spanning tree for G. More formally, let T be a minimum spanning tree for G with edge weights given by weight function w. ... k, if (u, v) = (x, y). Show that T is a minimum spanning tree for G with edge weights given by w'

sushmita asked in Algorithms Dec 1, 2016

1.6k views

graph-algorithms
minimum-spanning-tree
cormen

0 votes

0 votes

1 answer

4

gautamcse27 asked in Algorithms Sep 3, 2016

330 views

cormen Q
Given an adjacency-list representation of a directed graph, how long does it take to compute the out-degree of every vertex? How long does it take to compute the in-degrees?

gautamcse27 asked in Algorithms Sep 3, 2016

330 views

graph-algorithms
cormen

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent Posts

Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes

Subjects

All categories
General Aptitude (3.5k)
Engineering Mathematics (10.4k)
Digital Logic (3.6k)
Programming and DS (6.2k)
Algorithms (4.8k)
Theory of Computation (6.9k)
Compiler Design (2.5k)
Operating System (5.2k)
Databases (4.8k)
CO and Architecture (4.0k)
Computer Networks (4.9k)
Artificial Intelligence (79)
Machine Learning (48)
Data Mining and Warehousing (25)
Non GATE (1.4k)
Others (2.7k)
Admissions (684)
Exam Queries (1.6k)
Tier 1 Placement Questions (17)
Job Queries (80)
Projects (11)
Unknown Category (870)

64.3k questions

77.9k answers

244k comments

80.0k users

Recent Blog Comments

category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...

Send feedback
Rank Predictor
College Prediction
Useful Links
FAQ
Corrections
Discuss
Copyright
Request
Testimonials
Chat Logs
Chat
Badges
Search tips
Exam Category
Blog Category
Blog Tags
Privacy
Test Series
GATER
Refund Policy
Terms and Conditions
Contact Us

Developed by Chun

Twitter WhatsApp Facebook Reddit LinkedIn Email

Link Copied!