9 cmpstring_p_pp(const void *p1, const void *p2)
11 return strcasecmp((char * const) p1, * (char * const *) p2);
17 int main(int argc, char **argv)
24 size_t titles_read = 0;
34 int cur_dist_is_not_last;
40 printf("Supply article name to look up articles linking to it.\n");
46 * Read all incoming links into memory
49 in_file = fopen("links-incoming.bin", "rb");
51 fread(&titles, sizeof(titles), 1, in_file);
53 linki = malloc(titles * sizeof(size_t*));
54 linkis = malloc(titles * sizeof(size_t));
56 for (i = 0; i < titles; i++) {
59 fread(&linkis[i], sizeof(linkis[i]), 1, in_file);
60 //printf("linkis[%zd] = %zd\n", i, linkis[i]);
62 linki[i] = malloc(linkis[i] * sizeof(linki[i][0]));
64 j = fread(linki[i], sizeof(linki[i][0]), linkis[i], in_file);
65 assert(j == linkis[i]);
66 //for (j = 0; j < linkis[i]; j++) {
67 // fread(&linki[i][j], sizeof(linki[i][j]), 1, in_file);
70 printf("Incoming links read (%zd bytes).\n", ftell(in_file));
77 * Read all titles into memory
80 title = malloc(titles * sizeof(title[0]));
82 in_file = fopen("titles-sorted.txt", "r");
83 while (!feof(in_file)) {
85 ssize_t in_line_len = 0;
88 in_line_len = getline(&in_line, &zero, in_file);
90 /* Ignore empty lines and errors */
91 if (in_line_len < 2) {
95 /* Delete trailing newline */
96 in_line[in_line_len - 1] = '\0';
98 title[titles_read] = in_line;
103 printf("Titles read.\n");
108 /* Look up article ID */
109 cur_title = bsearch(argv[1], title,
110 titles, sizeof(title[0]),
114 printf("TITLE NOT FOUND: %s\n", argv[1]);
118 title_id = cur_title - title;
120 printf("Article %zd (%s) is linked from %zd articles:\n", title_id, title[title_id], linkis[title_id]);
122 for (i = 0; i < linkis[title_id]; i++) {
123 size_t x = linki[title_id][i];
124 printf(" %s\n", title[x]);
129 printf("\n\n\n\nBuilding table of distances...\n\n");
131 dist_table = malloc(titles * sizeof(dist_table[0]));
133 dist_table[title_id] = 0xdeadbeef;
135 for (i = 0; i < linkis[title_id]; i++) {
136 size_t x = linki[title_id][i];
141 cur_dist_is_not_last = 1;
143 while (cur_dist_is_not_last) {
144 size_t articles_found = 0;
146 cur_dist_is_not_last = 0;
148 for (i = 0; i < titles; i++) {
149 if (dist_table[i] == cur_dist) {
152 for (j = 0; j < linkis[i]; j++) {
153 size_t x = linki[i][j];
155 if (!dist_table[x]) {
156 dist_table[x] = cur_dist + 1;
160 cur_dist_is_not_last = 1;
166 printf("Distance %zd: Found %zd articles.\n", cur_dist, articles_found);
172 printf("\n\n\nThe articles with the distance of %zd are:\n\n", cur_dist);
173 for (i = 0; i < titles; i++) {
174 if (dist_table[i] == cur_dist) {
175 printf(" %s\n", title[i]);