Activities in Graphs
Budget: $30 – $250 USD
I need someone who understands about graphs and how to implement them, below is the description in the file of what should be done.
1. Random undirected graph generator that follows the “free to scale” model in which higher degree vertices are more likely to be connected. The function of this generator must have the following input parameters:
2. Number of vertices;
3. Number of edges;
4. Graph recording module in .net file (Pajek Format);
5. Graph loading module considering .net files (Pajek Format);
6. Function that checks if the graph is connected (if it is undirected) or strongly connected (if it is directed), returning True or False;
7. Function that checks if the graph is Eulerian, returning True or False;
8. Function that calculates the radius of the graph;
9. Function that calculates the diameter of the graph;
10. Function that generates two histogram graphs arranged side-by-side, one with the graph's degree distribution and the other with the graph's least path distribution;
11. Function that calculates the Intermediation Centrality of each vertex and returns the most central vertex according to the measure and its respective value;
12. Function that calculates the Proximity Centrality of each vertex and returns the most central vertex according to the measure and its respective value;
1. Random undirected graph generator that follows the “free to scale” model in which higher degree vertices are more likely to be connected. The function of this generator must have the following input parameters:
2. Number of vertices;
3. Number of edges;
4. Graph recording module in .net file (Pajek Format);
5. Graph loading module considering .net files (Pajek Format);
6. Function that checks if the graph is connected (if it is undirected) or strongly connected (if it is directed), returning True or False;
7. Function that checks if the graph is Eulerian, returning True or False;
8. Function that calculates the radius of the graph;
9. Function that calculates the diameter of the graph;
10. Function that generates two histogram graphs arranged side-by-side, one with the graph's degree distribution and the other with the graph's least path distribution;
11. Function that calculates the Intermediation Centrality of each vertex and returns the most central vertex according to the measure and its respective value;
12. Function that calculates the Proximity Centrality of each vertex and returns the most central vertex according to the measure and its respective value;