title: Graph Implementation in C
body: <p>I want to know what is best and fastest way of implementing graph data structure and its related algorithms.</p>
  
  <ol>
  <li>Adjacency-List is suggested by the book.</li>
  </ol>
  
  <p>But I fail to understand for a large graph when I want to find the edge between the two vertices <code>v1</code> and <code>v2</code></p>
  
  <p>I will have to traverse through the array which will be <code>O(n)</code>.</p>
  
  <p>Is my understanding correct or there is better approach to get this done.</p>