title: How to do shortest path algorithm for unweighted graph?
body: <p>I'm trying to find the shortest path from a vertex to another of a connected, unweighted graph.</p>
  
  <p>In this problem,the distance from a vertex to its adjacent vertex will be equal to 1.ie., if a graph with edges (a,b),(a,c) is considered, the distance from a to b and c will be 1 and the distance from b to c will be 2.
  Also, an adjacency list is maintained to store all the adjacent vertices of each vertex.</p>
  
  <p>So, is there any algorithms to find all the  shortest paths for the given problem??</p>