def find_biconnected_components(graph):
list_of_components = []<EOL>components = get_connected_components_as_subgraphs(graph)<EOL>for component in components:<EOL><INDENT>edge_list = _internal_get_biconnected_components_edge_lists(component)<EOL>list_of_components.extend(edge_list)<EOL><DEDENT>return list_of_components<EOL>
Finds all the biconnected components in a graph.
    Returns a list of lists, each containing the edges that form a biconnected component.
    Returns an empty list for an empty graph.