> //verifica daca o succesiune de varfuri//date de la tst reprez un circuit in graf#include …
-
-
>Afisare vecinii unui nod i //af vecinii unui nod i# include <stdio.h># include <conio.h>void main(void){int …
-
> #include <stdio.h>#include <conio.h>int min(int a, int b){if(a<=b) return a;else return b;}void main(){int ok,i,j,k,n,a[20][20],b[20][20],l,m,o,p;//citire matr …
-
> //af subgraful obtinut prin eliminare noduri si muchii //dintr-un graf orientat# include <stdio.h># include …
-
> //verifica daca un graf orientat este simetric //sau antisimetric# include <stdio.h># include <conio.h>void main(void){int …
-
> //af semigradul interior/exterior ptr un vf i#include <stdio.h>#include <conio.h>void main(void){int a[50][50],interior[50],exterior[50],n,i,j;FILE *f=fopen("c:intrare.txt","r");fscanf(f,"%d",&n);for(i=1;i<=n;i++) for(j=1;j<=n;j++) fscanf(f,"%d",&a[i][j]);fclose(f);for(i=1;i<=n;i++) …
-
> //Roy-Warshall – det matr drumurilor din matr de adiacenta#include <stdio.h>#include <conio.h>int min(int a, int …
-
> //Roy-Floyd – determina costul drumului minim de la i la j//are ca intrare matricea …
-
> //Prim# include <stdio.h># include <conio.h># include <values.h>typedef struct min { int lin,col; }min;int n,a[50][50],m[50][50];void …
-
>Grafuri: Afisare predecesorii si succesorii unui varf i //af predecesorii si succesorii unui varf i# …