The George Washington University
School of Engineering and Applied Science
Department of Computer Science
CSci 131 -- Data Structures
Lab #12
For labs meeting the week of Nov. 15, 1999

  1. Given a digraph with V = { A, B, C, D } and E = { <A,A>, <A,B>, <A,D>, <B,B>, <C,B>, <C,D>, <D,C> }, draw the graph and its adjacency matrix.
  2. For the preceding digraph, indicate whether or not the graph has each of the following properties: reflexive, irreflexive, symmetric, antisymmetric, transitive, connected, strongly connected, acyclic. For each property, give a counter example if a property is not present.
  3. For the preceding digraph, find the depth-first and breadth-first searches starting with each of the four vertices.
  4. Given a digraph with V = { A, B, C, D } and E = { <A,B>, <A,C>, <B,B>, <B,C>, <C,C>, <C,A>, <C,C>, <C,D> }, draw the graph and its adjacency matrix.