{var%20f='http://v.t.sina.com.cn/share/share.php?appkey=1515056452',u=z||d.location,p=['&url=',e(u),'&title=',e(t||d.title),'&source=',e(r),'&sourceUrl=',e(l),'&content=',c||'gb2312','&pic=',e(p||'')].join('');function%20a(){if(!window.open([f,p].join(''),'mb',['toolbar=0,status=0,resizable=1,width=440,height=430,left=',(s.width-440)/2,',top=',(s.height-430)/2].join('')))u.href=[f,p].join('');};if(/Firefox/.test(navigator.userAgent))setTimeout(a,0);else%20a();})(screen,document,encodeURIComponent,'','','https://www.manongdao.com/data/attach/logo/logo.png', '推荐 ら.Afraid 的问题《Best algorithm to determine if an undirected graph》','https://www.manongdao.com/q-1194922.html','页面编码gb2312|utf-8默认gb2312'));){kind=link}
What is the time complexity of the Best algorithm to determine if an undirected graph is a tree??
can we say Big-oh(n) , with n vertices??
标签：
graph-algorithm
相关问题
- Polygon from a grid of squares
- Best Fit Algorithm To Evenly Place Matchups In Rou
- Circulation in network flow
- Python: how to optimize the count of all possible
- Validating and normalizing a partially ordered set
相关文章
- Finding all paths in directed graph with specific
- Convert weighted direct cyclic graph to equivalent
- How to convert an undirected graph to a DAG?
- Finding shortest path with SPARQL query
- random algorithm over all topological sorts of a D
- Non-recursive Depth-First Search (DFS) Using a Sta
- Is there any JavaScript libraries for graph operat
- How to find multidimensional path of exact 0 cost
Yes, it is O(n).
Pick a starting node, and perform depth first traversal. If you visit a node more than once, it isn't a tree.
Yes, it is O(n). With a depth-first search in a directed graph has 3 types of non-tree edges - cross, back and forward.
For an undirected case, the only kind of non-tree edge is a back edge. So, you just need to search for back edges.
In short, choose a starting vertex. Traverse and keep checking if the edge encountered is a back edge. If you find n-1 tree edges without finding back-edges and then, run out of edges, you're gold.
(Just to clarify - a
back edgeis one where the vertex at the other end has already been encountered - and because of the properties of undirected graphs, the vertex at the other end would be an ancestor of the present node in the tree that is being constructed.)