Graph algorithms2

To improve the given code according to given task. Main features - generate graph correctly, mannualy create graph by hand, BFS algoriththm for shortest path without the weight. Condition in general-Create and implement a random graph generation algorithm. Graph must be constructed from user selected vertices number-that each vertex has no less than Kmin and no more than Kmax neighbours. The numbers Kmin and Kmax are also indicated by the user. Think about how to generate "interesting" to determine if it is. The graph must be plain, oriented or non-oriented, with no weights (or weights equal to 1). Also create method for something non-random graph insertion and generated graph printing by [login to view URL] of the resulting graphs is realized as a data structure- vertices adjacency-adjacency list(such as linked list or arraylist). Mentioned lists arrays must be one [login to view URL]'t use a matrix (two-dimensional) data structure that simplifies, but wastes memory(if the graph is not close to full, there will be many zeros in the matrix).Implement basic operations with this graph-based data structure. Also imlement this condition- using breadth-first method(for unweight graph) find out the the farthest vertex from the given vertex(source) in directed acyclic graph and find the path length between vertices. Print this path. If there are several vertices(farthest), it is enough once. My attachment is like background a part of task is implemented but requires the improvement for the given conditions above.