起点ノードから他のノードへの距離を計算したい

Question

キューを用いた幅優先探索、構造体のソートの勉強をしています。起点ノードから他のノードへの距離を計算するために、 calc_distance関数の引数やキューの要素をNode構造体へのポインタとして、Nodeのメンバ変数degree, adj_nodes, nameを用いたプログラムを作りたいのですが、エラーが出てしまいコンパイルが出来ません。どこが間違えているか教えていただきたいです。

#include <stdio.h>
#include <stdlib.h>
#include "graph_struct.h"
#include "queue.h"

Node** nodes_ptr;

int *disV; //距離ベクトル
Queue queue; //幅優先探索用のキュー
int adj_nodes;
Node degree;
Node name;

int init_value(){
  init_queue(&queue, N);
  disV = (int *) malloc(sizeof(int)*N);
}
void calc_distance(nodes_ptr origin){
  queue.first = queue.last = 0;
  enq(&queue, origin);

  for(int i = 0; i < N; i++) disV[i] = id-1;
  disV[id-1] = 0;

  int maxD = 0; //最大距離
  for(int d = 0; ; d++){
    int h1 = queue.first, h2 = queue.last;
    for(int h = h1; h < h2; h++){

      nodes_ptr node = deq(&queue);
      for(int k = 0; k < degree[node]; k++){
	nodes_ptr adj_node = adj_nodes[node][k];
	if(degree[adj_node] == -1){
	  disV[adj_node] = d+1;
	  enq(&queue, adj_node);
	}
      }
    }
    if(queue.first == N || queue.first == queue.last){ maxD = d; break; }
  }
  return maxD;
}


void print_distance(char *fn, int D){
  FILE *fp = fopen(fn, "w");
  int *hashV = (int *) calloc(D+1, sizeof(int));
  for(int i = 0; i < N; i++) hashV[disV[i]] += 1;
  int **hashM = (int **) malloc(sizeof(int *)*(D+1));
  for(int d = 0; d <= D; d++)
  hashM[d] = (int *) malloc(sizeof(int)*hashV[d]);
  for(int d = 0; d <= D; d++) hashV[d] = 0;
  for(int i = 0; i < N; i++){
  int d = disV[i]; hashM[d][hashV[d]++] = i;
}
  

  
  
  for(int d = 0; d <= D; d++){
    fprintf(fp, "d=%d (%d駅)\n", d, hashV[d]);
    for(int j = 0; j < hashV[d]; j++)
      fprintf(fp, "%s ", name[hashM[d][j]]);
    fprintf(fp, "\n-----------------------\n");
  }
  fclose(fp);
}

queue.hの中身

typedef struct{
  Node** nodes_ptr;
  int first;
  int last;
} Queue;

void init_queue(Queue *queue, Node n){
  queue->nodes_ptr = (Node **) calloc(n, sizeof(Node));
  queue->first = queue->last = 0; 

}

void enq(Queue queue, int nodes_ptr){
  queue->arr[queue->last++] = input;
}

int deq(Queue *queue){
  nodes_ptr output = queue->arr[queue->first++];
  return output;

}

エラーメッセージ
In file included from cpgm/distance.c:4:0:
cpgm/queue.h: In function ‘init_queue’:
cpgm/queue.h:8:39: error: incompatible type for argument 1 of ‘calloc’
 queue->nodes_ptr = (Node **) calloc(n, sizeof(N
                                     ^
In file included from cpgm/distance.c:2:0:
/usr/include/stdlib.h:468:14: note: expected ‘size_t {aka long unsigned int}’ but argument is of type ‘Node {aka struct <anonymous>}’
 extern void *calloc (size_t __nmemb, size_t __s
              ^
In file included from cpgm/distance.c:4:0:
cpgm/queue.h: In function ‘enq’:
cpgm/queue.h:14:8: error: invalid type argument of ‘->’ (have ‘Queue {aka struct <anonymous>}’)
   queue->arr[queue->last++] = input;
        ^
cpgm/queue.h:14:19: error: invalid type argument of ‘->’ (have ‘Queue {aka struct <anonymous>}’)
   queue->arr[queue->last++] = input;
                   ^
cpgm/queue.h:14:31: error: ‘input’ undeclared (first use in this function)
   queue->arr[queue->last++] = input;
                               ^
cpgm/queue.h:14:31: note: each undeclared identifier is reported only once for each function it appears in
cpgm/queue.h: In function ‘deq’:
cpgm/queue.h:18:3: error: unknown type name ‘nodes_ptr’
   nodes_ptr output = queue->arr[queue->first++]
   ^
cpgm/queue.h:18:27: error: ‘Queue {aka struct <anonymous>}’ has no member named ‘arr’
   nodes_ptr output = queue->arr[queue->first++]
                           ^
cpgm/distance.c: In function ‘init_value’:
cpgm/distance.c:15:22: error: incompatible type for argument 2 of ‘init_queue’
   init_queue(&queue, N);
                      ^
In file included from cpgm/distance.c:4:0:
cpgm/queue.h:7:6: note: expected ‘Node {aka struct <anonymous>}’ but argument is of type ‘int’
 void init_queue(Queue *queue, Node n){
      ^
cpgm/distance.c: At top level:
cpgm/distance.c:18:20: error: expected declaration specifiers or ‘...’ before ‘nodes_ptr’
 void calc_distance(nodes_ptr origin){
                    ^
cpgm/distance.c: In function ‘print_distance’:
cpgm/distance.c:63:30: error: subscripted value is neither array nor pointer nor vector
       fprintf(fp, "%s ", name[hashM[d][j]]);
                              ^
cpgm/distance.c: In function ‘main’:
cpgm/distance.c:74:14: warning: implicit declaration of function ‘calc_distance’ [-Wimplicit-function-declaration]
   int maxD = calc_distance(origin);

Comments

[y_waiwai]

エラーメッセージを提示しよう

Answer 1

void init_queue(Queue *queue, Node n){

queue->nodes_ptr = (Node **) calloc(n, sizeof(Node));

callocの第一引数はsize_tだけどそうなってませんな。
これをどうにかしよう

void enq(Queue queue, int nodes_ptr){

queue->arr[queue->last++] = input;
}

queue->なんたら、という表現はポインタじゃないとできません
これもどうにかしよう

そもそもの話になるけど、ヘッダファイルにコードは書くもんじゃありません。