test_hexo

本文章用来测试一些奇怪的东西。


Lorem ipsum dolor sit amet, consectetur adipiscing elit. Pellentesque hendrerit lacus ut purus iaculis feugiat. Sed nec tempor elit, quis aliquam neque. Curabitur sed diam eget dolor fermentum semper at eu lorem.

Do not just seek happiness for yourself. Seek happiness for all. Through kindness. Through mercy.

David LevithanWide Awake

NEW: DevDocs now comes with syntax highlighting. http://devdocs.io

Every interaction is both precious and an opportunity to delight.

1
2
3

[rectangle setX: 10 y: 10 width: 20 height: 20];

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

void bfs(int s){
queue<int> q;
q.push(s);
vis[s] = true;
while (!q.empty()){
int u = q.front();
q.pop();
for (遍历所有与u相邻的节点){
if (当前找到的扩展节点为解){
执行输出操作
}

if (!vis[u]){
q.push(u);
vis[u] = true;
}
}
}
return ;
}

-------------本文结束,感谢您的阅读转载请注明原作者及出处-------------

知识无价,码字不易。对您有用,敬请打赏。金额随意,感谢关心。