static void Main(string[] args)
{
// configuration
string input = "input.txt";
string output = "output.txt";
// our reading object
FileReader File = new FileReader();
// algorith object
Algorithm Alg = new Algorithm();
// grab data from text file
string[] words = File.getWords(input);
int size = File.getWordsSize(input);
// array of final labels
int[] labels = new int[size];
// array of conenctions
int[,] conseq = File.parseWords(words, size);
// seed
for (int i = 0; i < size; i++)
{
if (Alg.isPrime(conseq, i, size))
{
labels = Alg.giveLabel(labels, i);
break;
}
}
// finding other labels
for (int i = 0; i < size-1; i++)
{
labels = Alg.processNextLabel(conseq, labels, size);
}
// Hu
List<int[]> Result = Alg.algorithmHu(conseq, labels, size, 2);
File.printResult(Result, labels, 2, output);
}
static void Main(string[] args)
{
// configuration
string output = "output.txt";
// maxsize can be UNLIMITED - this is max size of generated graph
int maxsize = 15;
// our reading object
FileReader File = new FileReader();
// algorith object
Algorithm Alg = new Algorithm();
// random max size of graph
int size = Alg.generateGraphSize(maxsize);
// generate
int[,] graph = Alg.generateGraph(size);
// save graph to file
File.printResult(graph, size, output);
}