图论
guojiaqi007
这个作者很懒,什么都没留下…
展开
-
pat 1122. Hamiltonian Cycle (25)
https://www.patest.cn/contests/pat-a-practise/1122 参考了:http://www.liuchuo.net/archives/2748 #include #include #include using namespace std; int ** graph; bool isConnected(int *v, int n)转载 2017-02-20 21:16:11 · 202 阅读 · 0 评论 -
Hamiltonian Cycle (backtracing: 2^n)
参考了: http://www.geeksforgeeks.org/backtracking-set-7-hamiltonian-cycle/ #include #define N 5 bool isSafe(int v,bool graph[N][N], int *path, int pos) { if (graph[ path[pos - 1] ][v] == 0)转载 2017-02-20 21:40:17 · 272 阅读 · 0 评论 -
pat-top 1008. Airline Routes (35)
https://www.patest.cn/contests/pat-t-practise/1008 参考了https://zh.wikipedia.org/wiki/Tarjan%E7%AE%97%E6%B3%95 code 来自于http://blog.csdn.net/jtjy568805874/article/details/50759540 题意是求在有向图中的两个点是否在转载 2017-03-02 15:25:11 · 471 阅读 · 0 评论