使用修改過的Bron Kerbosch演算法求出最大Clique
思維如下
declare and define biggest as an integer with the value of 0
algorithm modifiedBronKerbosch( Pivot is int, PotentialExpansion is {x|x is int} ) is
Clique = {Pivot}
for each int I in PotentialExpansion do
if Clique ⊆ expand(I) then
Clique = Clique ⋃ {I}
biggest = max(biggest, n(Clique))
雖然效率沒有很好，但是還是個堪用的解喔!
有任何需要補充的可以留言喔:D