id,summary,reporter,owner,description,type,status,priority,milestone,component,resolution,keywords,cc,merged,author,reviewer,upstream,work_issues,branch,commit,dependencies,stopgaps
7854,speed up edge_connectivity in easy cases,ncohen,rlm,"This functions uses LP and has a big overhead because of that... Is many cases, though, the graph is not connected, or not 2-connected.
To test if a graph is connected, we already have the function is_connected which does the job very efficiently through depth-first-searches.
We also have a function is_strongly_connected for DiGraphs.
To test if a Graph is 2-connected, we can first :
* compute a strongly_connected_orientation with a linear-time function
* check whether the returned graph is strongly-connected ( linear time too )
Without this, much time is spent over building a useless Linear Program.
Nathann
",defect,closed,major,sage-4.3.4,graph theory,fixed,,,sage-4.3.4.alpha0,Nathann Cohen,Paul Zimmermann,N/A,,,,,