title: Drawing a graph for BFS that gives maximum length 4
body: <p>I just wanted to know what the question is asking about</p>
  <p>So the question states:</p>
  <p>Draw a graph, labelling the vertices with letters beginning at A, so that the queue in a Breath First Search of the graph beginning at vertex A would have a maximum length equal to 4.</p>
  <p>So I know how a Breadth First Search works but what does it mean that it has a maximum length equal to 4?</p>