title: Print in-degree and the out-degree of every vertex
body: <p>I am struggling with this algoritm question:</p>
  
  <p>How would I write a <code>theta(m+n)</code> algorithm that prints the in-degree and the out-degree of every vertex in an m-edge, n-vertex directed graph where the directed graph is represented using adjacency lists.</p>