java graph theory and Adjacency matrix program

I will send the pdf withe full details and information . The program is simple and short and needs knowledge of graph theory, directed graphs and Adjacency matrices/ The point is to create a program that build a words snake. Two distinct words can be joined if one, two or three of the letters at the end of the first word are the same as the letters at the beginning of the second and in the same order. Example apple and pleasant can be joined to form appleasant etc 1) Prompt the user for the name of the date file 2)Read the file and populate a word array in alphabetical order. 3) Prompt for two words from the user. change these words to lower case and make sure those two words are legitimate words in the list? 4)build the N*N adjacency matrix A. if A[I][j]=1 then of course word[i] is connected to word [j] by a path of length 1. 5) repeat this process for A^2,A^3,..........A^N, checking the I,J position for a non-zero entry. I will include also any classes you may need because I will like you to use the classes we implemented in my class. Also I will include a sample of how the Adjacency matrix is coded. Thanks and I dont mind paying for the project before its finished.