public static int groupLargestWordOrWords(LinkedList[] formable_words, LinkedList largest_formable_words){
		int formable_word_amount = 0;
		int largest_length = 0;
		
		String temporary_word;
		
		WordNode next_node;
		WordNode temporary_node;
		
		for(int i=0; i < 26; ++i){
			if((temporary_node = formable_words[i].getHead()) != null){
				formable_word_amount += formable_words[i].getSize();
				
				next_node = temporary_node.getNext();
				temporary_word = temporary_node.getWord();
			
				// Next word is greater in size than the currently listed longest word
				// Must become the head of the largest words
				// Forget old largest words
				if(temporary_word.length() >  largest_length){
					largest_formable_words.clear();
					largest_formable_words.add(temporary_node.copy());
					largest_length = temporary_word.length();
					
					// Add other ties
					while((next_node != temporary_node) && (next_node.getWord().length() == largest_length)){
						largest_formable_words.add(next_node.copy());
						next_node = next_node.getNext();
					}
					
				}else if(temporary_word.length() == largest_length){
					largest_formable_words.add(temporary_node.copy());
					
					// Add other ties
					while((next_node != temporary_node) && (next_node.getWord().length() == largest_length)){
						largest_formable_words.add(next_node.copy());
						next_node = next_node.getNext();
					}
				}
			}
		}
		
		return formable_word_amount;
	}