-
一个无向图G=(V,E),顶点集合V={1,2,3,4,5,6,7},边集合{(1,2),(1,3),(2,4),(3,4),(4,5),(...
一个无向图G=(V,E),顶点集合V={1,2,3,4,5,6,7},边集合{(1,2),(1,3),(2,4),(3,4),(4,5),(4,6),(5,7),(6,7)},从顶点1出发进行深度优先遍历,可能得到的顶点序列有哪些? A、1 2 4 6 7 5 3 B、1 3 4 5 6 7 2 C、1 3 4 2 5 7 6 D、1 2 4 3 6 5 7 答案:AC 这道题为何选AC,无向图是什么? 阅读全文 >>
-
suse安装mysql
下载安装包:wget https://cdn.mysql.com//archives/mysql-5.7/mysql-boost-5.7.22.tar.gz 安装依赖包:zypper install ncurses-devel 解压: tar 阅读全文 >>
# |
|
= |
---|---|---|
![]() |
南柯 | 2023 |
![]() |
cxlove | 1970 |
![]() |
vainner | 1763 |
4 | 1000310428赵成帅 | 1718 |
5 | XiaoWen | 1710 |
6 | 1000380213洪伟焕 | 1701 |
7 | weiben | 1684 |
8 | Jungle.Wei | 1678 |
9 | 1100310131曾翔宇 | 1664 |
10 | hongwh | 1653 |
dfs
21
implementation
19
dp
13
string
11
math
11
big number
10
number theory
9
combinatorics
9
happyoj
4
springboot
4
brute force
4
bfs
3
javascript
3
如梦令
3
greedy
3
linux
2
graph
2
divide and conquer
2
probabilities
2
sortings
2
data structures
2
xor
2
cron
1
judger
1
江南春
1
samba
1
autocomplete
1
OJ源码
1
css
1
jquery
1