算法实现之回溯算法实现2

求解图的最大团

最大团问题是图论中一个经典的组合优化问题。给定无向图G=(V,E)，其中V是非空集合，称为顶点集；E是V中元素构成的无序二元组的集合，称为边集，无向图中的边均是顶点的无序对，无序对常用圆括号“( )”表示。若U不包含于V，且对任意两个顶点u，v∈U有(u,v)∈E，则称U是G的完全子图。G的完全子图U是G的团。G的最大团是指G的最大完全子图。

python实现：

def is_clique(graph, vertices):
    for i in range(len(vertices)):
        for j in range(i + 1, len(vertices)):
            if not graph[vertices[i]][vertices[j]]:
                return False
    return True

def expand_clique(graph, vertices, candidates, max_clique):
    if not candidates and is_clique(graph, vertices):
        if len(vertices) > len(max_clique):
            max_clique.clear()
            max_clique.extend(vertices)
    else:
        for vertex in candidates[:]:
            neighbors = [v for v in candidates if graph[vertex][v]]
            expand_clique(graph, vertices + [vertex], neighbors, max_clique)
            candidates.remove(vertex)

def find_max_clique(graph):
    n = len(graph)
    vertices = [i for i in range(n)]
    max_clique = []

    expand_clique(graph, [], vertices, max_clique)

    return max_clique

# 示例
graph = [
    [False, True, True, False, False],
    [True, False, True, True, False],
    [True, True, False, True, True],
    [False, True, True, False, True],
    [False, False, True, True, False]
]
max_clique = find_max_clique(graph)
print("最大团的顶点集合:", max_clique)