You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
黄海 59632ede27
'commit'
2 years ago
..
Readme.txt 'commit' 2 years ago
Union-findSets.cpp 'commit' 2 years ago
bfs.cpp 'commit' 2 years ago
dfs.cpp 'commit' 2 years ago
floyd.cpp 'commit' 2 years ago

Readme.txt

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

本目录作用

GraphTheory 图论
CheckConnectivity 连通性检查

有向图的连通性检查共4种方法

1、dfs
2、bfs
3、并查集 注意:采用并查集判断连通性,是不需要建图的,性能效率要比 dfs和bfs高推荐作法。
4、Floyd