Final week of the semester and summer training program-Siyu Cold

First, summary

Recently, looking at the fifth chapter of the big petition, I learned some more advanced graph theory algorithms.

• The determination of the dichotomy graph
• The double-link component (BCC) of the non-direction graph and the cutting top
• Strongly connected components (SCC) of a forward graph
• 2-sat
• Minimum bottleneck path, where O (N2) computed Maxcost array can be optimized for binary to O (NLOGN)
• Minimum tree diagram of fixed roots, Zhu Liu algorithm
• With the right two-dimensional graph maximum matching, did not see too understand, for me also belongs to the black box algorithm, there are feasible top mark,, Hungarian tree, what ghost
• Stable marriage problem, algorithm is not difficult to understand, feel the algorithm is more fixed
• Network flow: Dinic algorithm, ISAP algorithm (not yet understood). The essence of the network flow is the composition, if you can map out the problem is basically solved. Common techniques are: multi-source multi-sinks can be added to a super-source and super-sink point, the point of the weighted graph, you can use the method of splitting. Network flow also has a lot of deformation and more advanced algorithms, the need to do more exercises in the back.

II. Training Plan

The current plan is to continue to consolidate the graph theory , many algorithms are just learned, will only use the template level. Continue to brush drawing on the topic of refining 500 questions, feeling that these topics are well-organized, first easy after difficult, gradual, and similar types of topics put together a comparison.

Then is DP , has been fell in DP above, has been shouting to learn DP. General DP, digital DP, interval DP, probability DP, tree DP, and so on. However, there has never been a targeted, high-intensity training for DP. Therefore, this training is a good time. I feel the CF on the DP topic is relatively novel, temporarily first plan according to the above DP topic through the number from more to less sort, one day to do DP.

Finally is the data structure aspect, the line tree, the balance tree, the splay ... As well as some high-level algorithms such as tree chain, the specific plan is not ready, the preliminary set for cattle and cattle blog above to find the topic bar.

Final week of the semester and summer training program-Siyu Cold