I have a graph and it's nodes adjacent matrix.
The issue is to find all nodes adjacent "all to all". For example (at the picture) the result must be [1,2,3,7]
all of this nodes connected together.
For any kind graph I need get get the list of all "all to all" nodes collection. How to solve it?
Thanks.
You are trying to find a clique in a graph. Finding a subgraph that is clique in an NP complete problem. You can read through the material here http://www.dfki.de/~neumann/ie-seminar/presentations/finding_cliques.pdf They have mentioned multiple methods here.