test if graph is two-edge connected
compute two-edge connected components of graph
A connected graph G is 2-edge connected if removal of any edge from G does not disconnect G. The IsTwoEdgeConnected command returns true if G is 2-edge connected and false otherwise.
TwoEdgeConnectedComponents returns the 2-edge connected components of a graph G. The output is a list of lists of vertices of G, each being the list of vertices of a component.
G ≔ Graph⁡a,b,b,c,a,c,d,e,e,f,d,f,c,d,a,h,a,i,h,i:
Download Help Document
What kind of issue would you like to report? (Optional)