Arkadaşlar merhaba;
Graph Analysis
Many things in the real world (such as friendship relations among people, distance relations among
cities or precedence relations among tasks) can be represented by graphs. Once these relations are
represented as graphs then one often needs to answer certain questions about these graphs.
In this project your task is to read a graph data, represent it with a suitable data structure in memory,
and answer certain questions about it.
More specifically, you will be given a text file which contains an undirected graph information.
Below is a sample file:
3 7
5 24
12 45
...
Each line above specifies an edge. For example, the first line says that there is an edge between vertex
3 and vertex 7, the second line says that there is an edge between vertex 5 and vertex 24, and so on.
You should be able to read this file and build a suitable data structure (adjacency-list or adjacencymatrix) to store it. A sample file will be provided to you. Note that during the demos we will test your
code with different text files (representing different graphs), so your code should work with any text
file confirming the above specifications.
Then your program will print the following menu:
1> Sparsity of the graph.
2> Degree of a vertex.
3> Max, min, and avg. degrees.
4> Shortest path between two vertices.
5> Shortest path passing through a particular vertex.
6> Average shortest path length.
7> Diameter of the graph.
Your program should carry out these tasks for the loaded graph. Specifically:
1) If option 1 is selected then your program should print the sparsity value of the graph. Sparsity value
of a graph is defined as the proportion of the number of edges to the total number of all possible edges
2) If option 2 is selected then your program should get a vertex id as input and print its degree. The
degree of a vertex is given by the number of edges connected to it. 3) If option 3 is selected then your program should print the maximum, minimum, and average degree
values of all vertices.
4) If option 4 is selected then your program should get two vertex ids as input and print the shortest
path length between these two vertices as well as the path itself.
5) If option 5 is selected your program should take three vertex ids as input and print the shortest path
between the first two vertices which passes through the third vertex. Again, you should print both the
shortest path length and the path itself.
6) If option 6 is selected then your program should print the average of the shortest paths between all
possible pairs of vertices.
7) If option 7 is selected then your program should print the diameter of the graph. The diameter of a
graph is the longest of the shortest distances between any two pair of vertices. You shoudl also print the
vertices on this longest shortest path.

şeklinde bir ödevim var,trade ' i 100 de 100 olanlar mesaj yazarsa sevinirim çünkü trade'im olmadığı için ücreti projeden önce yollamayı düşünüyorum. Teşekkürler