Leaderboard
Showing:
Handle Score
@Ibrahim Nash 6379
@blackshadows 6329
@mb1973 5358
@Quandray 5231
@akhayrutdinov 5111
@saiujwal13083 4510
@sanjay05 3762
@marius_valentin_dragoi 3522
@sushant_a 3459
@verma_ji 3357
@KshamaGupta 3318
Complete Leaderboard
Find the Maximum Flow
Hard Accuracy: 27.04% Submissions: 2752 Points: 8

Given a graph with N vertices numbered 1 to N and M edges, the task is to find the max flow from vertex 1 to vertex N.

Input:
The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. The first line of each test case contains two space separated integers N and M . Then in the next line are M space separated triplets x, y, z denoting an undirected edge from x to y with a flow capacity of z.

Output:
For each test case in a new line print a single integer denoting the maximum flow between 1 to N.

Constraints:
1<=T<=100
1<=N,M<=1000

Example:
Input:

2
5 4
1 2 1 3 2 2 4 2 3 2 5 5
4 4
1 2 8 1 3 10 2 4 2 3 4 3
Output:
1
5

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Find the Maximum Flow

Output Window