Cod sursa(job #2077507)

Utilizator LusianoStan Lucian Mihai Lusiano Data 28 noiembrie 2017 10:12:13
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb

#include <fstream>
using namespace std;
ifstream f("subgraf1.in");
ofstream g("subgraf1.out");
int k,n,a[21][21],x[21],p,q,m,y,z;
void afis(int k)
{
    int i,j;
     for(i=1;i<=k;i++) g<<x[i]<<' ';
  g<<'\n';
}
int verif(int k)
{
    for(int i=1;i<k;i++)
        if(x[k]==x[i]) return 0;
    return 1;
}
void bkt(int k)
{
    int i;
    for(i=1;i<=n;i++){
            x[k]=i;
    if(a[x[k]][x[k-1]]==1&&verif(k))
    if(x[k]==q) afis(k);
    else if(k<n) bkt(k+1);
    }
}
int main()
{
  f>>n>>m;
  for(int i=1;i<=m;i++)
  {
      f>>z>>y;
      a[z][y]=a[y][z]=1;
  }
f>>p>>q;
  x[1]=p;

  bkt(2);
}