Description

Construction of high-density graphs using the knowledge acquired during the classes

Construction of High-Density Graphs

Requirements:

• Export a weighted and labeled file (Pajek format attached)
• Load a graph from a file
• Function that checks if the graph is connected
• Function that shows the graph components if it is disconnected (consider weakly connected components for directed graphs)
• Function that checks if the graph is Eulerian or not
• Function that checks if the graph is Cyclic or not
• Function that calculates the Closeness Centrality of each node (consider the shortest-path distance)
• Function that calculates the Betweenness Centrality of each node (consider the shortest-path distance)
• Random graph generator
  • N nodes
  • N edges
  • Connected or not
• Choose a dataset with:
  • Minimum of 5,000 (five thousand) nodes
  • Minimum of 20,000 (twenty thousand) edges
  • The implementation of the previous tasks must support the chosen application
  • The problem must be modeled by the team, and copies of graphs or code — even partial (including using external graph APIs) — taken from the Internet or other sources will result in a grade of 0 for all involved teams.