本文整理汇总了C++中TrieNode::recursiveWordFind方法的典型用法代码示例。如果您正苦于以下问题：C++ TrieNode::recursiveWordFind方法的具体用法？C++ TrieNode::recursiveWordFind怎么用？C++ TrieNode::recursiveWordFind使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类TrieNode的用法示例。
在下文中一共展示了TrieNode::recursiveWordFind方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: recursiveWordFind
/**
* Recursively iterates through all words that can be made from this node
* Pushes all words onto common vector
* @param curWord current string from which to build on
* @param allWords the vector to store found words
*/
void TrieNode::recursiveWordFind(std::string curWord, wordPriorityVector &allWords){
TrieNode* curNode;
std::string curString;
//Word is found - store it
if(isTerminus)
allWords.push_back(std::make_pair(curWord, importance));
//Don't make recursive calls if no nodes are contained
if(nodes.empty())
return;
//Iterate through all letters known, make recursive calls
for(auto it = nodes.begin(); it != nodes.end(); it++){
//Get next letter's node
curNode = it->second;
//Add next letter to string
curString = curWord + it->first;
//Make recursive call
curNode->recursiveWordFind(curString, allWords);
}
}