int main(int argc,char* argv[])
{
std::vector<std::string> files;
files.push_back("..\\MetadataRepository\\parser.xml");
files.push_back("..\\MetadataRepository\\tokenizer.xml");
files.push_back("..\\MetadataRepository\\semiexpression.xml");
std::cout<<"\n\n Creating Graph for parser.xml,tokenizer.xml & semiexpression.xml : ";
std::cout << "\n "<< std::string(55,'=');
Graph<std::string,std::string> g;
GraphAlgorithm::GenerateGraphFromXML(files,g);
VertexFunctor<std::string,std::string> vf;
g.DepthFirstSearch(vf,g.VERTEX_EDGE);
std::cout<<"\n\n";
}
int _tmain(int argc, _TCHAR* argv[])
{
string file = "adjacencyMatrix.txt";
Graph G;
G.LoadGraph(file,1);
cout<<"*********************************************************\n";
cout<<"\t\tVisit Graph\n";
cout<<"*********************************************************\n";
G.BreadthFirstSearch();
G.DepthFirstSearch();
string file2 = "weightedAdjacencyMatrix.txt";
G.LoadGraph(file2,2);
cout<<"*********************************************************\n";
cout<<"\t\tMinimum spanning tree\n";
cout<<"*********************************************************\n";
Kruskal k;
k.MSTKruskal(G.vertexNumber,G.weightedAdjacencyMatrix);
Prim p;
int startVertex = 0;
p.MSTPrim(G.vertexNumber,G.weightedAdjacencyMatrix,startVertex);
string file3 = "weightedDirectedGraph.txt";
G.LoadGraph(file3,3);
cout<<"*********************************************************\n";
cout<<"\t\tSingle-source shortest path \n";
cout<<"*********************************************************\n";
Dijkstra d;
d.SSSPDijkstra(G.vertexNumber,G.weightedDirectedAdjacencyMatrix,startVertex);
return 0;
}
