Borderou de evaluare (job #2086467)
Utilizator | Data | 12 decembrie 2017 09:07:38 | |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Status | done |
Runda | Arhiva educationala | Compilator | java | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
Main.java:46: error: no suitable method found for add(ArrayList<Object>)
this.neighbors.add(new ArrayList<>());
^
method List.add(int,List<Edge>) is not applicable
(actual and formal argument lists differ in length)
method List.add(List<Edge>) is not applicable
(actual argument ArrayList<Object> cannot be converted to List<Edge> by method invocation conversion)
method Collection.add(List<Edge>) is not applicable
(actual argument ArrayList<Object> cannot be converted to List<Edge> by method invocation conversion)
Main.java:63: error: local variable dist is accessed from within inner class; needs to be declared final
return Long.compare(dist[o1], dist[o2]);
^
Main.java:63: error: local variable dist is accessed from within inner class; needs to be declared final
return Long.compare(dist[o1], dist[o2]);
^
Main.java:60: error: cannot infer type arguments for PriorityQueue<>
PriorityQueue<Integer> minHeap = new PriorityQueue<>(new Comparator<Integer>() {
^
4 errors
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !