检测循环，并在无向图中获取循环的成员

def detect_cycle(graph, start, visited, parent, cycle_members):
    visited[start] = True

    for neighbor in graph[start]:
        if not visited[neighbor]:
            if detect_cycle(graph, neighbor, visited, start, cycle_members):
                cycle_members.append(neighbor)
                return True
        elif parent != neighbor:
            cycle_members.append(neighbor)
            return True

    return False

def find_cycle(graph):
    num_nodes = len(graph)
    visited = [False] * num_nodes
    cycle_members = []

    for node in range(num_nodes):
        if not visited[node]:
            if detect_cycle(graph, node, visited, -1, cycle_members):
                cycle_members.append(node)

    return cycle_members

# 示例图的邻接表表示
graph = {
    0: [1, 2],
    1: [0, 2],
    2: [0, 1, 3],
    3: [2, 4],
    4: [3]
}

cycle = find_cycle(graph)
print("循环的成员:", cycle)