Borderou de evaluare (job #2086480)
Utilizator | Data | 12 decembrie 2017 09:20:05 | |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Status | done |
Runda | Arhiva educationala | Compilator | java | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
Main.java:88: error: no suitable constructor found for PriorityQueue(<anonymous Comparator<GraphTuple>>)
super(new Comparator<GraphTuple>() {
^
constructor PriorityQueue.PriorityQueue(SortedSet<? extends GraphTuple>) is not applicable
(actual argument <anonymous Comparator<GraphTuple>> cannot be converted to SortedSet<? extends GraphTuple> by method invocation conversion)
constructor PriorityQueue.PriorityQueue(PriorityQueue<? extends GraphTuple>) is not applicable
(actual argument <anonymous Comparator<GraphTuple>> cannot be converted to PriorityQueue<? extends GraphTuple> by method invocation conversion)
constructor PriorityQueue.PriorityQueue(Collection<? extends GraphTuple>) is not applicable
(actual argument <anonymous Comparator<GraphTuple>> cannot be converted to Collection<? extends GraphTuple> by method invocation conversion)
constructor PriorityQueue.PriorityQueue(int,Comparator<? super GraphTuple>) is not applicable
(actual and formal argument lists differ in length)
constructor PriorityQueue.PriorityQueue(int) is not applicable
(actual argument <anonymous Comparator<GraphTuple>> cannot be converted to int by method invocation conversion)
constructor PriorityQueue.PriorityQueue() is not applicable
(actual and formal argument lists differ in length)
1 error
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !