Today I had my own quiz algorithm for a semester, and I can not figure out these two questions, and they listened to me all day. I looked through my notes and lectures, and I'm still not sure. I would appreciate it if anyone could take a look and give some idea of these issues. This is not homework, and I was already in the quiz.
True or false questions
1) [Paraphrase] The maximum number of edges in a bipartite graph with n vertices is n (n-1) / 2.
I set this to False, my logic is that n vertices means that we have two n / 2 rows. The first node has n / 2 connections to the second line, the second line has n / 2 connections to the second line ... etc.
Therefore, I calculated the maximum number of edges in a bipartite graph, where n vertices will be (n ^ 2/4).
2) [Paraphrase] Is it possible to cut out that it is not necessary the minimum st reduction on a flow chart (Ford-Fulkerson algorithm), so that the throughput is greater than the throughput st?
I set a lie, but I do not understand the question ... Is it possible to cut st so that the throughput is greater? I know the weak duality theorem and "max flow = min cut", so I specify false, but I have no idea.
Short answer question:
1) Explain an effective way to check the weather. The graph is linked.
, , BFS , . , O (m + n), . , , , .
2) :
, []
{A, D}, {A, E}, {B, C}, {B, D}, {C, E}, , {A}, { B}, {C}, {D}, {E}...
, !:)