Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream f("graf.in");
- ofstream g("graf.out");
- int n,m,viz[100],a[100][100],conex=0,gradimpar=0;
- void citire()
- {
- int i,x,y;
- f>>n>>m;
- for(i=1;i<=m;i++)
- {
- f>>x>>y;
- a[x][y]=1;
- a[y][x]=1;
- }
- }
- void df(int k)
- {
- int i;
- viz[k]=1;
- for(i=1;i<=n;i++)
- {
- if(a[k][i]==1 && viz[i]==0)
- df(i);
- }
- }
- void verificare_conexitate()
- {
- int i,ok=1;
- for(i=1;i<=n;i++)
- if(viz[i]==0) ok=0;
- if(ok==1) conex=1;
- }
- int grad(int x)
- {
- int i,gradnod=0;
- for(i=1;i<=n;i++)
- {
- gradnod=gradnod+a[x][i];
- }
- return gradnod;
- }
- void verificare_grade()
- {
- int i;
- for(i=1;i<=n;i++)
- {
- if(grad(i)%2!=0)
- gradimpar=1;
- }
- }
- int main()
- {
- citire();
- df(1);
- verificare_conexitate();
- verificare_grade();
- if(gradimpar==0 && conex==1)
- g<<"Graful este eulerian!";
- else g<<"Graful nu este eulerian!";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement