![](https://img-blog.csdnimg.cn/20201014180756923.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
c++进阶
程适场
这个作者很懒,什么都没留下…
展开
-
回溯法以及3着色问题的c++实现
回溯法(Backtrack) the 3-coloring problem(3着色问题) Given an undirected graph G=(V,E), it is required to color each vertex in V with one of three colors, say 1,2, and 3, such that no two adjacent vertices have the same color. search tree(搜索树) 首先抛弃数据结构中所学到的树以及二叉搜索原创 2020-10-03 15:22:11 · 3478 阅读 · 0 评论 -
c++ STL
set set<int> s; //插入 s.insert(); //输出 for(set<int>::iterator iter=s.begin();iter!=s.end();iter++){ cout<<*iter<<endl; }原创 2020-05-02 23:09:24 · 107 阅读 · 0 评论