Compilare: main.cpp:65:35: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings] 65 | void BFS(char* fisierIntrare ="bfs.in",char* fisierIesire={"bfs.out"});///primul exercitiu(afiseaza intr-un fisier lungimea drumurilor de la un nod la restul) | ^~~~~~~~ main.cpp:65:64: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings] 65 | void BFS(char* fisierIntrare ="bfs.in",char* fisierIesire={"bfs.out"});///primul exercitiu(afiseaza intr-un fisier lungimea drumurilor de la un nod la restul) | ^~~~~~~~~ main.cpp:67:33: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings] 67 | void DFS(char* fisierIesire="dfs.out"); | ^~~~~~~~~ main.cpp: In member function 'void Graf::BFS(char*, char*)': main.cpp:213:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 213 | for (int i = 0; i < lsAd[nodCrt].size(); i++)///trec prin toate nodurile adiacente | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graf::BellmanFord(std::ifstream&, std::vector<int>&)': main.cpp:725:16: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else] 725 | if (cost[vecin.first] > cost[nodCrt] + vecin.second) //vecin.first -> nodul catre care duce arcul // vecin.second -> costul arcului | ^ main.cpp: In member function 'int Graf::Hamilton(std::ifstream&)': main.cpp:985:40: warning: suggest parentheses around '-' inside '<<' [-Wparentheses] 985 | HamiltonAjut(i,1<<nrNoduri - 1, j, C, Cost); | ~~~~~~~~~^~~