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-362 (Section 9.2.2, 9.2.3 and 9.3.1)
pages 551-557 (Section 12.2.2, 12.2.3 and 12.3.1)
Implementation of a simple graph by means of an adjacency list:
Implementation of a simple graph by means of an adjacency matrix:
Give the pseudocode for the operations InAdjacentVertices and
InsertVertex of the implementation of a graph by means of an adjacency matrix.