Borderou de evaluare (job #1740740)
Utilizator | Data | 12 august 2016 11:13:47 | |
---|---|---|---|
Problema | Arbore partial de cost minim | Status | done |
Runda | Arhiva educationala | Compilator | java | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
Main.java:122: error: no suitable constructor found for PriorityQueue(<anonymous Comparator<PrimMST.Node>>)
Queue<Node> minHeap = new PriorityQueue<Node>(new Comparator<Node>() {
^
constructor PriorityQueue.PriorityQueue(SortedSet<? extends PrimMST.Node>) is not applicable
(actual argument <anonymous Comparator<PrimMST.Node>> cannot be converted to SortedSet<? extends PrimMST.Node> by method invocation conversion)
constructor PriorityQueue.PriorityQueue(PriorityQueue<? extends PrimMST.Node>) is not applicable
(actual argument <anonymous Comparator<PrimMST.Node>> cannot be converted to PriorityQueue<? extends PrimMST.Node> by method invocation conversion)
constructor PriorityQueue.PriorityQueue(Collection<? extends PrimMST.Node>) is not applicable
(actual argument <anonymous Comparator<PrimMST.Node>> cannot be converted to Collection<? extends PrimMST.Node> by method invocation conversion)
constructor PriorityQueue.PriorityQueue(int,Comparator<? super PrimMST.Node>) is not applicable
(actual and formal argument lists differ in length)
constructor PriorityQueue.PriorityQueue(int) is not applicable
(actual argument <anonymous Comparator<PrimMST.Node>> 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 !