Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- A - macierz sasiedztwa
- B - kwadrat macierzy sasiedztwa
- int liczba_diamentow = 0;
- int w1,w2,w3;
- int n = liczba wierzcholkow;
- int ktory=1;
- for (int i = 1; i <= n; i++) {
- B = kwadrat_macierzy(A);
- w1 = 0;
- w2 = 0;
- w3 = 0;
- for (int j = 1; j <= n; j++){
- if (B[i][j] != 0 && A[i][j] != 0) {
- if(ktory==1){
- w1 = j;
- ktory++;
- }
- else if(ktory==2){
- w2 = j;
- ktory++;
- }
- else if(ktory==3){
- w3 = j;
- ktory=1;
- break;
- }
- }
- }
- if (w1 = 0 || w2 = 0 || w3 = 0)
- continue;
- liczba_diamentów++;
- if (A[w2][w3]!=0 && A[w1][w3]!=0 && A[w1][w2]!=0 ) //Klika - znalezione dwa diamenty
- liczba_diamentów++;
- usun_wierzcholek_z_macierzy_A(i);
- usun_wierzcholek_z_macierzy_A(w1);
- usun_wierzcholek_z_macierzy_A(w2);
- usun_wierzcholek_z_macierzy_A(w3);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement