Data Structure Graph: strong connectivity
2014-04-19 11:04
85 查看
如果为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/
相关文章推荐
- Data Structure Graph: strong connectivity
- dataStructure@ Check if a directed graph has cycles
- 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
- 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
- 【Data Structure & Algorithm】HashSet, HashMap, HashTable原理详解
- HDU 5929 Basic Data Structure(模拟,deque)——2016CCPC东北地区大学生程序设计竞赛 - 重现赛
- 【Data structure & Algorithm】把二元查找树转变成排序的双向链表
- hdu Data Structure? 线段树
- [Leetcode] 170. Two Sum III - Data structure design 解题报告
- SB tree——A temporal aggregation data structure
- LeetCode Add and Search Word - Data structure design (trie树)
- leetcode 日经贴,Cpp code -Add and Search Word - Data structure design
- UESTC 483 Data Structure Problem
- heap data structure