Rezumat problemă

ComponenteConexe

#438

Se dă lista muchiilor unui graf neorientat. Să se afișeze componentele conexe ale acestui graf.

Fișiere Candale Silviu (silviu) ușoară

Clasa 11 Teoria Grafurilor Parcurgerea grafurilor neorientate componente conexe

Rezolvă

Detalii

Problema	ComponenteConexe	Operații I/O	componenteconexe.in/componenteconexe.out
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#63133798	Utilizator	György Artúr (gyartur)
Fișier	componenteconexe.cpp	Dimensiune	1.66 KB
Data încărcării	16 Februarie 2026, 17:40	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from componenteconexe.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::vector<unsigned int>*, std::vector<std::vector<unsigned int> > >; _Tp = std::vector<unsigned int>; _Compare = main()::__lambda0]':
/usr/include/c++/4.8/bits/stl_algo.h:2296:78:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::vector<unsigned int>*, std::vector<std::vector<unsigned int> > >; _Compare = main()::__lambda0]'
/usr/include/c++/4.8/bits/stl_algo.h:2337:62:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::vector<unsigned int>*, std::vector<std::vector<unsigned int> > >; _Size = int; _Compare = main()::__lambda0]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::vector<unsigned int>*, std::vector<std::vector<unsigned int> > >; _Compare = main()::__lambda0]'
componenteconexe.cpp:64:109:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda0) (std::vector<unsigned int>&, const std::vector<unsigned int>&)'
    while (__comp(*__first, __pivot))
                                   ^
componenteconexe.cpp:64:49: note: candidates are:
     sort(components.begin(), components.end(), [](vector<size_t> &a, vector<size_t> &b){return a[0] < b[0];});

                                                 ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from componenteconexe.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: bool (*)(std::vector<unsigned int>&, std::vector<unsigned int>&) <conversion>
    while (__comp(*__first, __pivot))
                                   ^
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: note:   candidate expects 3 arguments, 3 provided
componenteconexe.cpp:64:87: note: main()::__lambda0
     sort(components.begin(), components.end(), [](vector<size_t> &a, vector<size_t> &b){return a[0] < b[0];});

                                                                                       ^
componenteconexe.cpp:64:87: note:   no known conversion for argument 2 from 'const std::vector<unsigned int>' to 'std::vector<unsigned int>&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from componenteconexe.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda0) (const std::vector<unsigned int>&, std::vector<unsigned int>&)'
    while (__comp(__pivot, *__last))
                                  ^
componenteconexe.cpp:64:49: note: candidates are:
     sort(components.begin(), components.end(), [](vector<size_t> &a, vector<size_t> &b){return a[0] < b[0];});

                                                 ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from componenteconexe.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: bool (*)(std::vector<unsigned int>&, std::vector<unsigned int>&) <conversion>
    while (__comp(__pivot, *__last))
                                  ^
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: note:   candidate expects 3 arguments, 3 provided
componenteconexe.cpp:64:87: note: main()::__lambda0
     sort(components.begin(), components.end(), [](vector<size_t> &a, vector<size_t> &b){return a[0] < b[0];});

                                                                                       ^
componenteconexe.cpp:64:87: note:   no known conversion for argument 1 from 'const std::vector<unsigned int>' to 'std::vector<unsigned int>&'

Cum funcționează evaluarea?