title: Get the vertex with highest degree of a large graph in GraphX
body: <p>In Spark GraphX, I use <code>graph.degrees.reduce( (a,b) =&gt; if (a._2 &gt; b._2) a else b )</code> to get the highest-degree vertex in a graph called <a href="https://snap.stanford.edu/data/soc-LiveJournal1.html" rel="nofollow">LiveJournal</a> [4,847,571 nodes, 68,993,773 edges].
  <br>
  <br>
  I'm writing an algorithm for my graph analytic study. The LiveJournal graph I'm running the algorithm on is very large, my machine takes forever to execute the reduce phase! So I was wondering if there is a more efficient and less time-consuming way to get the same result of the line above.</p>