Archive
Posts Tagged ‘graph’
In a graph, find the largest complete subgraph
December 23, 2024
Leave a comment
Problem
In a graph, you want to find the largest complete subgraph. A complete subgraph is a graph in which every node is connected to every other node.
Real-life example: in a party it’s a group of friends where everybody knows each other.
Solution
It’s a well-known graph problem that can be solved with the Bron-Kerbosch algorithm. You can find more info here, where you can also find a Python implementation.
Python Adventures 