Data Structure Graph: strong connectivity
2014-04-21 04:11
423 查看
如果为undirected graph就是dfs或者bfs，如果都能visit则为连通O(V+E).
如果为directed graph就先dfs或者bfs，再reverse direct，再dfs或者bfs，如果两次都连通则为strong connect
http://www.geeksforgeeks.org/connectivity-in-a-directed-graph/
如果为directed graph就先dfs或者bfs，再reverse direct，再dfs或者bfs，如果两次都连通则为strong connect
http://www.geeksforgeeks.org/connectivity-in-a-directed-graph/
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- dataStructure@ Check whether a given graph is Bipartite or not
- Use emacs & Graphviz to plot data structure
- Data Structure Graph: cycle in a directed graph
- Data Structure Graph: prim
- Data Structure Graph: strong connectivity
- Updated version: Use emacs & Graphviz to plot data structure
- <OJ_Sicily>Graph Problems From Data Structure Course
- dataStructure@ Find if there is a path between two vertices in a directed graph
- [转]Data Structure Recovery using PIN and PyGraphviz
- dataStructure@ Check if a directed graph has cycles
- 211. Add and Search Word - Data structure design
- UVA 11995 I Can Guess the Data Structure! .
- uva 11995 I Can Guess the Data Structure!
- LeetCode *** 211. Add and Search Word - Data structure design（字典树）
- 170. Two Sum III - Data structure design
- UVA 11995 I Can Guess the Data Structure!
- LeetCode(211) Add and Search Word - Data structure design
- Add and Search Word - Data Structure Design
- Light OJ 1303——Basic Data Structure
- introduction to algorithms data structure lesson_1 stack