Rezumat problemă

Drum Hamiltonian

#579

Se dă un graf orientat cu n noduri. Determinați, dacă există, un drum hamiltonian.

Fișiere Candale Silviu (silviu) medie

Clasa 11 Teoria Grafurilor Probleme diverse cu grafuri orientate

Rezolvă

Detalii

Problema	Drum Hamiltonian	Operații I/O	drum_hamiltonian.in/drum_hamiltonian.out
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#58145616	Utilizator	Poleuca Matei (kanyeest)
Fișier	drum_hamiltonian.cpp	Dimensiune	711 B
Data încărcării	16 Mai 2025, 11:18	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

drum_hamiltonian.cpp: In function 'void afis(int)':
drum_hamiltonian.cpp:8:9: error: expected unqualified-id before '=' token
 {for(int=1;i<=k:i++)cout<<x[i]<<" ";

         ^
drum_hamiltonian.cpp:8:9: error: expected ';' before '=' token
drum_hamiltonian.cpp:8:9: error: expected primary-expression before '=' token
drum_hamiltonian.cpp:8:12: error: 'i' was not declared in this scope
 {for(int=1;i<=k:i++)cout<<x[i]<<" ";

            ^
drum_hamiltonian.cpp:8:16: error: found ':' in nested-name-specifier, expected '::'
 {for(int=1;i<=k:i++)cout<<x[i]<<" ";

                ^
drum_hamiltonian.cpp:8:15: error: 'k' is not a class, namespace, or enumeration
 {for(int=1;i<=k:i++)cout<<x[i]<<" ";

               ^
drum_hamiltonian.cpp: In function 'int valid(int)':
drum_hamiltonian.cpp:12:11: error: expected '(' before '<' token
 {if(k>2)if<a[x[k-1]][x[k]]==0)return 0;

           ^
drum_hamiltonian.cpp: In function 'void bkt(int)':
drum_hamiltonian.cpp:20:7: warning: suggest explicit braces to avoid ambiguous 'else' [-Wparentheses]
     if(valid(k))if(k==n)ok=1;

       ^

Cum funcționează evaluarea?