Borderou de evaluare (job #2076568)
| Utilizator |  Lazar Eusebiu sebi_andrei2008 |
Data | 26 noiembrie 2017 19:42:25 |
|---|---|---|---|
| Problema | Algoritmul lui Dijkstra | Status | done |
| Runda | Arhiva educationala | Compilator | java | Vezi sursa |
| Scor | 0 | ||
Raport evaluator
Eroare de compilare:
Main.java:22: error: no suitable constructor found for PriorityQueue(NodeComparator)
PriorityQueue<Node> queue = new PriorityQueue<Node>(new NodeComparator());
^
constructor PriorityQueue.PriorityQueue(SortedSet<? extends Node>) is not applicable
(actual argument NodeComparator cannot be converted to SortedSet<? extends Node> by method invocation conversion)
constructor PriorityQueue.PriorityQueue(PriorityQueue<? extends Node>) is not applicable
(actual argument NodeComparator cannot be converted to PriorityQueue<? extends Node> by method invocation conversion)
constructor PriorityQueue.PriorityQueue(Collection<? extends Node>) is not applicable
(actual argument NodeComparator cannot be converted to Collection<? extends Node> by method invocation conversion)
constructor PriorityQueue.PriorityQueue(int,Comparator<? super Node>) is not applicable
(actual and formal argument lists differ in length)
constructor PriorityQueue.PriorityQueue(int) is not applicable
(actual argument NodeComparator 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 !
