Borderou de evaluare (job #1930556)
Utilizator | Data | 19 martie 2017 00:21:38 | |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Status | done |
Runda | Arhiva educationala | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘void Dijkstra()’:
user.cpp:24:18: error: request for member ‘begin’ in ‘nod’, which is of non-class type ‘std::set<std::pair<int, int> > [50004]’
node=nod.begin()->second;
^
user.cpp:25:18: error: request for member ‘begin’ in ‘nod’, which is of non-class type ‘std::set<std::pair<int, int> > [50004]’
dist=nod.begin()->first;
^
user.cpp:26:13: error: request for member ‘erase’ in ‘nod’, which is of non-class type ‘std::set<std::pair<int, int> > [50004]’
nod.erase(nod.begin());
^
user.cpp:26:23: error: request for member ‘begin’ in ‘nod’, which is of non-class type ‘std::set<std::pair<int, int> > [50004]’
nod.erase(nod.begin());
^
user.cpp:27:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<graf[node].size();i++)
^
user.cpp:34:25: error: request for member ‘erase’ in ‘nod’, which is of non-class type ‘std::set<std::pair<int, int> > [50004]’
nod.erase(nod.find(pair<int,int>(d[v], v)));
^
user.cpp:34:35: error: request for member ‘find’ in ‘nod’, which is of non-class type ‘std::set<std::pair<int, int> > [50004]’
nod.erase(nod.find(pair<int,int>(d[v], v)));
^
user.cpp:36:21: error: request for member ‘insert’ in ‘nod’, which is of non-class type ‘std::set<std::pair<int, int> > [50004]’
nod.insert(pair<int,int>(d[v],v));
^
user.cpp: In function ‘int main()’:
user.cpp:51:21: error: invalid types ‘std::vector<std::pair<int, int> > [50004][std::set<std::pair<int, int> > [50004]]’ for array subscript
graf[nod].push_back(pair<int,int> (vecin, cost));
^
user.cpp:54:9: error: request for member ‘insert’ in ‘nod’, which is of non-class type ‘std::set<std::pair<int, int> > [50004]’
nod.insert(make_pair(0,1));
^
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !