public IEnumerable <string> Generate(int vertexCount)
{
var bitsCount = (int)(((vertexCount + .0) / 2) * (vertexCount - 1));
HashSet <long> codes = new HashSet <long>();
long limit = 1L << (bitsCount + 1);
for (var i = 0L; i < limit; i++)
{
var vector = GenerationUtils.ToAjentityVector(i, vertexCount);
var graph = new Graph(vector);
if (!ConnectivityChecker.IsConnected(graph))
{
continue;
}
var code = GenerationUtils.GetSimpleCode(vector);
if (codes.Contains(code))
{
continue;
}
foreach (var substitution in GenerationUtils.EnumerateAllSubstitutions(graph))
{
var currentVector = GenerationUtils.UseSubstitution(vector, substitution);
var currentCode = GenerationUtils.GetSimpleCode(currentVector);
codes.Add(currentCode);
}
yield return(graph.ToG6());
}
}
public IEnumerable <string> Generate(int vertexCount)
{
var bitsCount = (int)(((vertexCount + .0) / 2) * (vertexCount - 1));
List <Graph> graphs = new List <Graph>();
long limit = 1L << (bitsCount + 1);
for (var i = 0L; i < limit; i++)
{
var vector = GenerationUtils.ToAjentityVector(i, vertexCount);
var graph = new Graph(vector);
if (!ConnectivityChecker.IsConnected(graph))
{
continue;
}
bool isUnique = true;
foreach (var substitution in GenerationUtils.EnumerateAllSubstitutions(graph))
{
var currentVector = GenerationUtils.UseSubstitution(vector, substitution);
var currentGraph = new Graph(currentVector);
if (graphs.Contains(currentGraph))
{
isUnique = false;
break;
}
}
if (isUnique)
{
graphs.Add(graph);
yield return(graph.ToG6());
}
}
}
public IEnumerable <string> Generate(int vertexCount)
{
var bitsCount = (int)(((vertexCount + .0) / 2) * (vertexCount - 1));
long limit = 1L << (bitsCount);
for (var i = 0L; i < limit; i++)
{
var vector = GenerationUtils.ToAjentityVector(i, vertexCount);
var graph = new Graph(vector);
if (!ConnectivityChecker.IsConnected(graph))
{
continue;
}
var canonicalCode = IsomorphismChecker.GetCon(graph);
var simpleCode = GenerationUtils.GetBigIntegerSimpleCode(graph);
if (canonicalCode == simpleCode)
{
yield return(graph.ToG6());
}
}
}