Added code for Erdos-Renyi complexity/star complexity experiment.

Author: highperformancecoder

models/starComplexity.cc

@@ -625,3 +625,24 @@ unsigned StarComplexityGen::starUpperBound(const linkRep& x) const
   assert(ub>0 && complementUb>0);
   return min(ub, complementUb);
 }
+
+GraphComplexity StarComplexityGen::randomERGraph(unsigned nodes, unsigned links)
+{
+  linkRep g=0;
+  if (links>nodes*(nodes-1)/2)
+    throw runtime_error("links requested exceeds maximum possible: "+to_string(nodes*(nodes-1)/2));
+  for (unsigned l=0; l<links; ++l)
+    {
+      unsigned node1=nodes*uni.rand(), node2;
+      do
+        node2=nodes*uni.rand();
+      while (node1==node2);
+      g|=edge(node1,node2);
+    }
+
+  GraphComplexity r;
+  r.starComplexity=::starUpperBound(g,nodes);
+  NautyRep ng=toNautyRep(g, nodes);
+  r.complexity=ecolab::complexity(ng, true);
+  return r;
+}

models/starComplexity.h

@@ -1,5 +1,5 @@
 // hard code maximum number of nodes
-constexpr unsigned maxNodes=22, maxStars=2*maxNodes-1;
+constexpr unsigned maxNodes=1000, maxStars=2*maxNodes-1;
 
 #include "netcomplexity.h"
 
@@ -156,5 +156,11 @@ struct StarComplexityGen
 
   /// return an upper bound on the number of stars in the link representation
   unsigned starUpperBound(const linkRep&) const;
+
+  /// random number generator
+  ecolab::urand uni;
+  
+  /// randomly generate an ER graph, and return the starUpperBound and complexity
+  GraphComplexity randomERGraph(unsigned nodes, unsigned links);
 };