Question

For C++

Please write as detail as possible.

For Word-Reversed-Word Ladder:::: Word ladder is an ancient game played before the time of computers.

Create a one page Concept hierarchy of the ADTs.

Write the name, and key characteristics on hierarchy

Answer 1

void Graph::FindPath(const string &startWord, const string &endWord)
{
map<string, WordNode*> searchMap = baseMap[startWord.length()];
deque<string> words;
WordNode *currentNode;
Vertex *currentVertex;
list<string> path;
list<WordNode *>::const_iterator iter;
string currentWord;
words.push_front(startWord);
while (!words.empty()) {
currentWord = words.front();
currentNode = searchMap[currentWord];
currentVertex = currentNode->getVertex();
if(currentVertex->getColor() == Vertex::white)
{
if(currentWord == endWord) {
cout << "\nPATH:\n";
list<string>::iterator strIter;
for (strIter = path.begin(); strIter != path.end(); strIter++)
{
cout << *strIter << "\n";
}
cout << currentWord;
return;
}
else {
cout << "Checking " << currentWord << "\n";
currentVertex->setColor(Vertex::gray);
words.pop_front();
words.push_back(currentWord);
continue;
}
}
else if(currentVertex->getColor() == Vertex::gray) {
cout << "Getting Adj List for: " << currentWord << "\n";
list<WordNode *> adjacencyList = currentNode->getLinks();
path.push_back(currentWord);
for (iter = adjacencyList.begin(); iter != adjacencyList.end(); iter++) {
cout << "Pushing " << (*iter)->getVertex()->getWord() << "\n";
if ((*iter)->getVertex()->getColor() != Vertex::gray)
words.push_front((*iter)->getVertex()->getWord());
}
currentVertex->setColor(Vertex::black);
}
else if (currentVertex->getColor() == Vertex::black) {
cout << "Removing " << currentWord << "\n";
words.pop_front();
}
}
}