小编Cha*_*ara的帖子

我正在尝试在 Julia 中实现一篇论文（第 212-213 页）中的 3-clique（三角形）查找算法，但我遇到了代码问题

function find_triangle(graph::AdjacencyListGraphs)\n\n    new_graph = deepcopy(graph)\n    sort!(new_graph.edges, by=x->new_graph.D[x], rev=true)\n    cliques = Vector{Vector{Int64}}()\n    marked_nodes = Set()\n\n    for i in 1:new_graph.n - 2\n        cur = new_graph.edges[new_graph.edges.keys[1]]\n\n        # mark vertices adjacent to i\n        for j in 1:length(cur)\n            push!(marked_nodes,cur[j])\n        end\n\n        # search in marked nodes\n        for j in 1:length(cur)\n            u = cur[j]\n            for w in new_graph.edges[u]\n                if w in marked_nodes\n                    cur_clique = [new_graph.edges.keys[1], u, w]\n                    push!(cliques, cur_clique)\n                end\n            delete!(marked_nodes, u)\n            end\n        end\n\n        # delete node\n        for …