/*
Thomas Baca
GSP290
DataStructures
*/

#include <iostream>
using namespace std;
#include "SLL.h"
#include "DLL.h"
#include "Queue.h"
#include "HashTable.h"
#include "Stack.h"
#include "Tree.h"
#include "Boggle.h"
#include <fstream>
#include <string>

int main()
{	
	//Boggle loading the hashtable with all possible answers////
	cout << "\n***********************Boggle***************************" << endl;
	Boggle<string> boggle;
	boggle.LoadWordList();
	boggle.createBoard();
	 for(int i = 0; i < 3; ++i)
    {
        for(int j = 0; j < 3; ++j)
        {
			string sofar;
			boggle.Solve( i, j, sofar);
        }
    }

	cout << endl << endl;
	 
}