问题
Is there a known algorithm to find all complete sub-graphs within a graph? I have an undirected, graph and I need to find all complete graphs present in that undirected graph.
Is there an existing algorithm for this?
来源：https://stackoverflow.com/questions/30389474/how-many-complete-graph-present-in-given-undirected-graph