void imprimeCaminhoAoContrario (Digraph G, Vertex s, Vertex t) {
Vertex w;
DIGRAPHpath(G, s, t);
for (w = t; w != s; w = parent[w])
printf("%d-", w);
printf("%d\n", s);
}
void imprimeCaminho (Digraph G, Vertex s, Vertex t) {
Vertex w;
int *v, size, i;
DIGRAPHpath(G, s, t);
for (w = t, size = 0; w != s; w = parent[w]){
size++;
}
v = malloc(size * sizeof(int));
v[i] = s;
for ( i = size, size = 0; w != s; w = parent[w]){
size;
}
}
int main(int argc, char *argv[]){
int i;
Digraph G = DIGRAPHinit(5);
if(argc>1){
for(i=0; i<argc; i++)
printf("%s ", argv[i]);
printf("\n");
}
DIGRAPHinsert(G,0,1);
DIGRAPHinsert(G,0,3);
DIGRAPHinsert(G,2,4);
DIGRAPHinsert(G,4,1);
GRAPHinsert(G,2,3);
DIGRAPHshow(G);
/*
DIGRAPHremove(G,0,1);
DIGRAPHremove(G,0,3);
DIGRAPHremove(G,0,4);
DIGRAPHremove(G,2,1);
DIGRAPHremove(G,4,2);
DIGRAPHremove(G,3,4);
DIGRAPHshow(G);
printf("\n");
GRAPHremove(G,2,3);
GRAPHremove(G,1,4);
DIGRAPHshow(G);
*/
if(DIGRAPHpath(G,0,4))
printf("Existe caminho de 0 --> 4\n");
else
printf("Não existe caminho de 0 --> 4\n");
if(DIGRAPHpath(G,1,4))
printf("Existe caminho de 1 --> 4\n");
else
printf("Não existe caminho de 1 --> 4\n");
printf("\n");
GRAPHinsert(G,1,3);
DIGRAPHshow(G);
if(DIGRAPHpath(G,1,4))
printf("Existe caminho de 1 --> 4\n");
else
printf("Não existe caminho de 1 --> 4\n");
if(DIGRAPHcycle(G))
printf("Existe ciclo em G\n");
else
printf("Não existe ciclo em G\n");
printf("\n");
printf("\n");
DIGRAPHremove(G,3,1);
DIGRAPHremove(G,3,2);
DIGRAPHshow(G);
if(DIGRAPHcycle(G))
printf("Existe ciclo em G\n");
else
printf("Não existe ciclo em G\n");
printf("\n");
return 0;
}