PriorityQueue and compareto methode
<p>A small Question but I cant find a good explanation on how to do it. I am trying to write a dijkstra algorithm. And I need to use a Priority Queue. I want to compare the different vertices of a graph depending on their distance.
But I dont really know how to write such a compare methode because I never used a priority queue.</p>
