Spark Graphx shortest paths and print the vertexs
<p>I have generate a  graph G in Spark GraphX using Scala. I would like to find the number of edges that should be crossed starting from a known vertex pointA to arrive in another vertex pointB. In other words, I need the some shortest paths  and display the points from the vertex pointA to the vertex pointB calculated in number of edges (not using the edges' weights).</p>

<p>I am new to spark and scala , and i am struggling about these problems. is any possible that i can use the pregel to do that , pls let me know ! Thanks a lot!  </p>