// problem2.cpp : Defines the entry point for the console application.
//
#include <fstream>
#include <iostream>
#include <string>
using namespace std;

#include "apvector.h"
#include "graph.h"

bool different_by_one(string str1, string str2)
{
	int numDifferent=0;
	if(str1.length()!=str2.length())
		return false;
	for(int count=0;count<str1.length();count++)
	{
		if(str1[count]!=str2[count])
			numDifferent++;
		if (numDifferent>1)
			return false;
	}
	if(numDifferent==0)
		return false;
	return true;
}

int main()
{
	const int MAX_NEIGHBORS=30;
	ifstream in("words.dat",ios::in);
	graph<string> myGraph;
	string word;
	apvector<int> numNeighbors(MAX_NEIGHBORS,0);
	apvector<string> words(10000);
	int numWords=0;
	while(in>>word)
	{
		myGraph.addVertex(word);
		words[numWords]=word;
		numWords++;
		for(int count=0;count<myGraph.numVertices();count++)
		{
			if(different_by_one(word,words[count]))
			{
				myGraph.addEdge(word,words[count]);
			}
		}
	}
	in.close();
	for(int count=0;count<myGraph.numVertices();count++)
	{
		numNeighbors[list_length(myGraph.getNeighbors(words[count]))]++;
	}
	for(int count=0;count<MAX_NEIGHBORS;count++)
		cout<<numNeighbors[count]<<" words have "<<count<<" neighbors\n";

	return 0;
}