comment on

Here's the latest, fastest version of my program. Is it fast enough to solve a 100,000 node case? No.

#!/usr/bin/perl

use strict; # https://perlmonks.org/?node_id=11109069 # clique
use warnings;
use List::Util qw( uniq );

my $edges = <<END; # from https://en.wikipedia.org/wiki/Clique_(graph_
+theory)
[1,2],[1,3],[1,4],
[2,3],[2,4],
[3,4],
[4,5],[23,4],
[5,6],[5,7],[5,8],
[6,7],
[7,8],
[8,9],[10,8],
[10,9],[11,9],[12,9],[13,9],
[10,13],
[11,12],[11,13],
[12,13],
[13,14],
[14,15],[14,21],
[15,16],[15,17],[15,19],
[16,17],
[17,18],[17,19],
[18,19],[18,20],[18,21],
[19,20],[19,21],[19,22],
[20,23],
[21,22],[21,23],
[22,23],
END

$edges =~ s/(?<=\[)[\w,]+(?=\])/ join ',', sort split ',', $& /ge;  # 
+fix order
print "$edges\n";
my %edges = map +( $_ => '(*FAIL)' ), $edges =~ /\w+,\w+/g;
my %cliques;
my %seen;

find( uniq sort $edges =~ /\w+/g );                     # start with e
+very node

sub find
  {
  $seen{ my $set = "@_" }++ and return;
  if( my @out = $set =~ /\b(\w+)\b.+\b(\w+)\b(??{ $edges{"$1,$2"} || "
+" })/ )
    {
    for my $node ( @out )     # pair of unconnected nodes, try without
+ each one
      {
      @_ > 3 and find( grep $_ ne $node, @_ );
      }
    }
  else
    {
    $cliques{ $set }++;                                 # it is fully 
+connected
    }
  }

my $uniquecliques = '';
for ( sort { length $b <=> length $a } sort +uniq
  keys %cliques, map tr/,/ /r, keys %edges )
  {
  my $pattern =  " $_ " =~ s/\w+/\\b$&\\b/gr =~ s/ /.*?/gr;
  $uniquecliques =~ /^$pattern$/m or $uniquecliques .= "$_\n";
  }

print $uniquecliques;
[download]

Outputs:

[1,2],[1,3],[1,4],
[2,3],[2,4],
[3,4],
[4,5],[23,4],
[5,6],[5,7],[5,8],
[6,7],
[7,8],
[8,9],[10,8],
[10,9],[11,9],[12,9],[13,9],
[10,13],
[11,12],[11,13],
[12,13],
[13,14],
[14,15],[14,21],
[15,16],[15,17],[15,19],
[16,17],
[17,18],[17,19],
[18,19],[18,20],[18,21],
[19,20],[19,21],[19,22],
[20,23],
[21,22],[21,23],
[22,23],

11 12 13 9
15 16 17
15 17 19
17 18 19
18 19 20
18 19 21
19 21 22
21 22 23
1 2 3 4
10 13 9
10 8 9
13 14
14 15
14 21
20 23
5 6 7
5 7 8
23 4
4 5
[download]

This 23 node case runs in about 0.05 seconds on my machine.

I am curious about what the real problem is here. Perhaps there is something in the real problem that could lead to partioning or something else that could limit that actual node size per case.

Also, how many edges are there in your 100,000 node case?

In reply to Re: Sub set where all are connected by tybalt89
in thread Sub set where all are connected by Sanjay

Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!

Titles consisting of a single word are discouraged, and in most cases are disallowed outright.

Read Where should I post X? if you're not absolutely sure you're posting in the right place.

Please read these before you post! —

Posts may use any of the Perl Monks Approved HTML tags:

a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr

You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)

	For:		Use:
	&		`&`
	<		`<`
	>		`>`
	[		`[`
	]		`]`

Link using PerlMonks shortcuts! What shortcuts can I use for linking?

See Writeup Formatting Tips and other pages linked from there for more info.