(int pair1[], int pair2[])
| 4 | //(u, v, weight) |
| 5 | PriorityQueue<int[]> pq = new PriorityQueue<>(new Comparator<>(){ |
| 6 | public int compare(int pair1[], int pair2[]){ |
| 7 | return pair1[2] - pair2[2]; |
| 8 | } |
| 9 | }); |
| 10 | // insert edges in pq |
| 11 | for(int i=0;i<V;i++){ |
nothing calls this directly
no outgoing calls
no test coverage detected