If you use the first edition of the textbook, follow the reading material
in orange. If you use the second edition,
follow the reading material in brown.
pages 356-361 (Section 9.2.2 and 9.2.3)
pages 551-556 (Section 12.2.2 and 12.2.3)
Implementation of a simple graph by means of an adjacency list:
Implementation of a simple graph by means of an adjacency matrix:
In the implementation of a simple graph by means of an adjacency matrix,
can removeVertex be implemented in O(n)? If your answer is yes, show
how it can be done. If your answer is no, explain why it cannot be done.