(version 1.1) (Undirected) Graph 1:
Representation type:________________________
A| D  F  G  H
B| E  H 
C| D  F  G  H 
D| A  C  F  H
E| B
F| A  C  D  G
G| A  C  F
H| A  B  C  D  

How many connected components in this graph? 
Perform a DFS search on this graph; draw
the DFS search tree associated with the search. 
Then classify each non-tree edge as forward, back, 
or cross.  
















(Directed) Graph 2:
Representation type:________________________

  A  B  C  D  E  F  G  H  
A 0  0  0  0  0  0  0  0  
B 1  0  0  0  0  0  0  0  
C 1  0  0  0  1  0  1  0  
D 1  1  1  0  1  0  0  0  
E 0  0  0  0  0  0  0  0  
F 1  1  0  0  1  0  1  1  
G 1  1  0  0  1  0  0  0  
H 1  1  1  0  1  0  1  0  

Perform a DFS search on this graph; draw
the DFS search tree associated with the search. 
Then classify each non-tree edge as forward, back, 
or cross.