summaryrefslogtreecommitdiff
path: root/src/03/matrix.c
blob: 752eabd4fd8874af72913c573eef6e4b7ec13d5e (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include <stdio.h>
#include <stdlib.h>

char labels[26] = {
  'a', 'b', 'c', 'd',
  'e', 'f', 'g', 'h',
  'i', 'j', 'k', 'l',
  'm', 'n', 'o', 'p',
  'q', 'r', 's', 't',
  'u', 'v', 'w', 'x',
  'y', 'z'
};

void matrix_traverse(int n, int graph[n][n], int visited[n], int vertex) {
  printf("->(%c)", labels[vertex]);
  visited[vertex] = 1;

  for (int edge = 0; edge < n; ++edge) {
    if (!visited[edge] && graph[vertex][edge] > 0) {
      graph[vertex][edge] = 0;
      matrix_traverse(n, graph, visited, edge);
      graph[edge][vertex] = 0;
      printf("->(%c)", labels[vertex]);
    }
  }
  for (int edge = 0; edge < n; ++edge) {
    if (graph[vertex][edge] > 0 && graph[edge][vertex] > 0) {
      graph[vertex][edge] = 0;
      matrix_traverse(n, graph, visited, edge);
      graph[edge][vertex] = 0;
      printf("->(%c)", labels[vertex]);
    }
  }
}

void matrix_inspect(int n, int graph[n][n]) {
  printf("\n");

  printf("| ");
  for (int i = 0; i < n; ++i)
    printf("|%c", labels[i]);
  printf("|\n");

  for (int i = 0; i < n; ++i) {
    printf("|%c|", labels[i]);
    for (int j = 0; j < n; ++j)
      printf("%d|", graph[i][j]);
    printf("\n");
  }
}