Java paper needed urgently

IN JAVA. Your program should read an adjacency matrix from the file, build the graph using linked structures, and process the graph to find all the paths, then read an new adjacency matrix, etc., until the file is empty. Make sure to allow for reasonable error situations. Programs which use the adjacency nmatrix to find the paths will receive no credit under correctness.

You may not use Array lists or List classes from the Java library.

You may store the adjacency matrix in any way you like . You may use any variation of linked strucutres to represent the graph . Justify your i mpl ementation and design decisions.