Need help with this assignment.
Part 1:
- Draw a simple undirected graph G that has 10 vertices and 15 edges.
- Draw an adjacency list and adjacency matrix representation of the undirected graph in question 1.
- Write a short paragraph to describe the graph you draw.
Part 2:
- Use big O notation to explain the complexity and performance of the following data structures: Arrays, linked list, and vector
- Use big O notation to explain the complexity and performance of the following data structures: Stacks and Queues