Fundamental Data Structures - Implementation of the Graph Representations and their Operations - IT Assessment Answer

IT Assessment Answer

Task

Task A: Implement the Graph Representations and their Operations

In this task, you will implement the directed, weighted graph using the adjacency list and incidence matrix representations. Each representation will be implemented by a data structure. Your implementation should support the following operations:

• Create an empty directed graph (implemented as a constructor that takes zero arguments). Add a vertex to the graph.

• Add an edge to the graph.

• Get the weight of an edge in the graph. Update weight of an edge in the graph.

• Delete a vertex from the graph.

• Compute the k-nearest in-neighbors of a vertex in the graph. Compute the k-nearest out-neighbors of a vertex in the graph. Print out the set of vertices of the graph.

• Print out the set of edges and their weights of the graph.

Task B: Evaluate your Data Structures

In this second task, you will evaluate your two implemented structures in terms of their time complexities for the di erent operations and di erent use case scenarios. Scenarios arise from the possible use cases of a social/communication network.

Write a report on your analysis and evaluation of the di erent implementations. Consider and recommend which scenarios each type of implementation would be most appropriate. The report should be 8 pages or less, in font size 12. See the assessment rubric (Appendix A) for the criteria we are seeking in the report.

This IT Assessment has been solved by our IT experts at My Uni Papers. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.