#### Reading material

Pages 554-556 (Section 12.2)
#### Additional material

Implementation of a simple *undirected* graph by means of an adjacency matrix:
PostScript and
PDF
In the implementation of a graph by means of an adjacency matrix, we restrict our
attention to undirected graphs. There are simple mixed graphs whose representation
by means of an adjacency matrix give rise to a matrix in which cells contain more
than one edge (Can you think of an example?).

#### Question

Write an algorithm that tests if a simple undirected graph is connected.