#define maxGraphSize 310

#include "BiGraph_ME.h"

list<biGraphString> readModules_biGraph(char *fileName)
{
	list<biGraphString> L_module;
	string line;
	string storeLine[4];
	int st = 0;

	ifstream File2(fileName);
	if(File2.fail())
	{
		cerr<<"\n file open fail";
		return L_module;
	}
	while (!File2.eof())
	{
		getline(File2,line);
		storeLine[st] = line;
		st++;
		if (st==3)
		{
			st=0;
			//cout<<storeLine[0]<<'\n';

			biGraphString moduleTp;
			moduleTp.GoID = storeLine[0];
			list<string> nodes;
			list<string>::iterator inodes;
			nodes = mySplit(storeLine[1], ";");
			inodes = nodes.begin();
			while(inodes!=nodes.end())
			{
				(moduleTp.edges).push_back(*inodes);
				inodes++;
			}
			L_module.push_back(moduleTp);
		}
	}
	File2.close();
	return L_module;
}



int main(int argc, char *argv[])
{
	time_t secondsc,secondse;
	secondsc = time (NULL);

	list<biGraphString> G_biGraph = readModules_biGraph("sampleData_4_ME_algorithm.txt");
	
	list<biGraphString>::iterator biGraph;
	list<biGraphString>::iterator biGraphList[G_biGraph.size()];

	cout<<"\nTotal module = "<<G_biGraph.size()<<"\n";
	cout<<" --- Note: running the samples needs 5 to 15 minutes\n";
	biGraph = G_biGraph.begin();
	for (int i=0; i<G_biGraph.size(); i++)
	{
		biGraphList[i] = biGraph;
		biGraph++;
	}
	#pragma omp parallel for

	for (int i=0; i<G_biGraph.size(); i++)
	{
		//cout<<"\nDoing: "<<i;
		//cout<<"\n"<<(biGraphList[i]->GoID)<<"<"<<i<<"\n";
		biGraphString bgTemp = *biGraphList[i];
		BiGraph_ME gg(bgTemp);

		ME_mutation solu2 = gg.WMEM_cover_main();
		//cout<<" ---------------------------------------------------------\n";
		//cout<<(biGraphList[i]->GoID)<<"   ";
		//cout<<(biGraphList[i]->edges).size()<<"--\n";
		#pragma omp critical
		{
			cout<<"\n"<<(biGraphList[i]->GoID)<<" -- "<<i<<"\n";
			gg.printSolution_gene(solu2);
		}
	}


	secondse = time (NULL);
	cout<<"\n Total time(s)="<<(secondse-secondsc)<<"\n\n";
	
	return 0;
}