Rezumat problemă

Graf Partial 2

#422

Se dă lista muchiilor unui graf neorientat cu n vârfuri, etichetate de la 1 la n. Din acest graf se elimină toate muchiile cu o extremitate într-un vârf de grad maxim. Să se determine numărul de muchii eliminate și să se afișeze matricea de adiacență a grafului parțial obținut.

Fișiere Candale Silviu (silviu) medie

Clasa 11 Teoria Grafurilor Probleme elementare cu grafuri neorientate

Rezolvă

Detalii

Problema	Graf Partial 2	Operații I/O	graf_partial_2.in/graf_partial_2.out
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#56664431	Utilizator	Pirvan Ana (Pirvan_Ana)
Fișier	graf_partial_2.cpp	Dimensiune	1.37 KB
Data încărcării	01 Martie 2025, 16:19	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

graf_partial_2.cpp: In function 'int main()':
graf_partial_2.cpp:16:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0;i < v[a].size();i++)

                                  ^
graf_partial_2.cpp:19:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (i == v[a].size())

                            ^
graf_partial_2.cpp:27:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (v[i].size() > Max)

                           ^
graf_partial_2.cpp:31:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (v[i].size() == Max)

                            ^
graf_partial_2.cpp:32:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (j = 0;j < v[i].size();j++)

                                      ^
graf_partial_2.cpp:39:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0;j < sters[i].size();j++)

                                      ^
graf_partial_2.cpp:41:65: error: no matching function for call to 'find(std::vector<int>::iterator, std::vector<int>::iterator, __gnu_cxx::__alloc_traits<std::allocator<int> >::value_type&)'
             auto it = find(v[i].begin(), v[i].end(), sters[i][j]);

                                                                 ^
graf_partial_2.cpp:41:65: note: candidate is:
In file included from /usr/include/c++/4.8/bits/locale_facets.h:48:0,
                 from /usr/include/c++/4.8/bits/basic_ios.h:37,
                 from /usr/include/c++/4.8/ios:44,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from graf_partial_2.cpp:1:
/usr/include/c++/4.8/bits/streambuf_iterator.h:369:5: note: template<class _CharT2> typename __gnu_cxx::__enable_if<std::__is_char<_CharT2>::__value, std::istreambuf_iterator<_CharT> >::__type std::find(std::istreambuf_iterator<_CharT>, std::istreambuf_iterator<_CharT>, const _CharT2&)
     find(istreambuf_iterator<_CharT> __first,
     ^
/usr/include/c++/4.8/bits/streambuf_iterator.h:369:5: note:   template argument deduction/substitution failed:
graf_partial_2.cpp:41:65: note:   '__gnu_cxx::__normal_iterator<int*, std::vector<int> >' is not derived from 'std::istreambuf_iterator<_CharT>'
             auto it = find(v[i].begin(), v[i].end(), sters[i][j]);

                                                                 ^
graf_partial_2.cpp:48:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0;j < v[i].size();j++)

                                  ^
graf_partial_2.cpp:12:32: warning: unused variable 'k' [-Wunused-variable]
     int n, a, b, i, nr = 0, j, k, mat[101][101] = { 0 }, Max, Min;

                                ^
graf_partial_2.cpp:12:63: warning: unused variable 'Min' [-Wunused-variable]
     int n, a, b, i, nr = 0, j, k, mat[101][101] = { 0 }, Max, Min;

                                                               ^

Cum funcționează evaluarea?