算法的设计方法(C程序):一、迭代法 二、穷举搜索法三、递推法 四、递归五、回溯法 六、贪婪法 -algorithm design method (C program) : 1, 2 iteration, the exhaustive search method three, four recursive method, recursive 5, backtracking 6, greedy algorithm

一些常用的算法设计方法和C++环境下的实现方法。主要包括：迭代法、穷举搜、索法、递推法、递归、回溯法、贪婪法、分治法 -Some commonly used algorithm design methods and C environments are implemented. These mainly include: iterative method, exhaustive search, rope method, recursive method, recursion, backtra

Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking.

各种算法模版,代码集,回溯搜路径,数据结构，ICPC/ACM-Templates of various algorithms, code set, backtracking search path, data structures, ICPC/ACM