i’ve problem in writing algorithms so plz tell me where can i practice to improve myself
Given a flow f of maximum value, write an algorithm to compute minimum s-t cut in O(m+n) time where m is no. of edges and n is no. of nodes in graph
Hello @Yadav_Monika, in you are talking about the bipartite check ques, then, first of all, try to understand what the problem statement says and what is the logic behind that and how that works for the test cases. After understanding the logic then try to write the code by yourself. And yes initially in the starting it will take time to understand the concepts.
And if you talking about the flows I recommend you to first try and be comfortable with the other topics of the graphs. Flows is a very very advanced topic and questions generally become difficult with flows. So, first of all, understand other topics properly and try some questions and then try to learn this concept and this concept will require time to understand and practice.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.
Actually i studied this topic but I’m not able to write algorithm.
do you understand the algo ??
i know how to find maximum flow and minimum s-t cut in a flow diagram but when i have to write algorithm it’s confusing, i don’t know from where should i start
i know how to find maximum flow and minimum s-t cut in a flow diagram but when i have to write algorithm it’s confusing, i don’t know from where should i start.
Then you need to understand the code clearly and practice it by writing it on paper and then dry it on system.