@not_implemented_for('directed')
def is_biconnected(G):
 bcc = list(biconnected_components(G))
 if (not bcc):
  return False
 return (len(bcc[0]) == len(G))

@ not_implemented_for ( 'directed' ) def is_biconnected ( G ) : bcc = list ( biconnected_components ( G ) ) if ( not bcc ) : return False return ( len ( bcc [ 0 ] ) == len ( G ) )
return true if the graph is biconnected .