guojiaqi007的专栏

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)

参考了：http://www.geeksforgeeks.org/backtracking-set-7-hamiltonian-cycle/#include #define N 5bool isSafe(int v,bool graph[N][N], int *path, int pos) { if (graph[ path[pos - 1] ][v] == 0)

https://www.patest.cn/contests/pat-t-practise/1008参考了https://zh.wikipedia.org/wiki/Tarjan%E7%AE%97%E6%B3%95code 来自于http://blog.youkuaiyun.com/jtjy568805874/article/details/50759540题意是求在有向图中的两个点是否在