仅做个人笔记

Head of a Gang. One way that the police finds the head of a gang is to check people's phone calls. ' If there is a phone call between A and B, we say that A and B is related(相关). The weight of a rel...

Forwards on Weibo. Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. Hence a social network is formed with follow...

// DFS遍历图 --------------------------------------------------------- const MAXV = 1000; const INF = 1000000000; // 邻接矩阵版 int n, G[MAXV][MAXV]; bool vis[MAXV]; void DFS(int u, int depth) { vis[u] = tru...

//code1 DFS数出连通块数 ------------------------------- #include <cstdio> #include <vector> #include <cstring> using namespace std; const int MAXN = 1010; vector<int> G[MAXN]; bool v...

// 存储图 --------------------------------------------------------- // 若仅有点权，需要结构体Node记录一个节点的编号和点权，最好用邻接表。 // 若仅有边权，最好直接用邻接矩阵。 // 若有点权和边权，用邻接矩阵记录结构体Node节点吧。 // 邻接表存储有点权的图 struct Node { int v; int w; ...

（待）