Re^3: Sub set where all are connected

I'm still puzzled if you want the connected components or the cliques of a graph.

Cheers Rolf
_{(addicted to the Perl Programming Language :)

Wikisyntax for the Monastery
FootballPerl is like chess, only without the dice}

Comment on Re^3: Sub set where all are connected

Replies are listed 'Best First'.
Re^4: Sub set where all are connected by Sanjay (Sexton) on Nov 23, 2019 at 16:08 UTC
Sorry. The method above helps in finding the longest connection. Help in finding the largest clique(s) highly welcome.	[reply]
Re^5: Sub set where all are connected (updated) by LanX (Saint) on Nov 23, 2019 at 16:15 UTC
Clique search is NP-complete and if you are expecting cliques with "hundreds of members, if not thousands" it's unlikely you can solve the general case with a generic algorithm in acceptable time. You have only a chance if your huge graph has special properties - like symmetries - simplifying the task. Update See also https://en.wikipedia.org/wiki/Clique_problem Cheers Rolf _{(addicted to the Perl Programming Language :) Wikisyntax for the Monastery FootballPerl is like chess, only without the dice}	[reply]