Graph algorithms

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. Qualification upgrades must be top-down to provide more information on Kmax neighbors. The numbers Kmin and Kmax are also indicated by the user. Think about how to generate "interesting" to determine if it is. Count must be plain, oriented or non-oriented, with no weights (or weights equal to 1). Please note that information about changes that are included in the market would be taken or not. Also placing 100 instruments (no) (eg printing, embossing). Each of the resulting graphs is realized as a data structure - the proximity of the vertices ("neighborhood"). Due to efficient memory utilization, all lists (arrays) of data structures must be monotonous. Don'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. Define the tools for assigning and scanning graph edges (required for another task). Reach out to get information on what's most important graph and at what distance. Print this path. If there are several such peaks, one is enough. I have added almost done project which should be improved, attachment is presented.