如何从C中的文件列表中创建邻接矩阵

问题描述 投票:-1回答:1

嘿,我想从c中的文件中删除列表中的邻接矩阵,但是我不确定该怎么做。到目前为止,这是我的代码:

#include <stdio.h>
#include <stdlib.h>

typedef struct value {
  int num;
  char start_vertex[250];
  char destination_vertex[250];
} value;

int main()
{
  const int nLines = 43; // number of lines in my text file
  FILE * fptr;
  value * valuesPtr = malloc(sizeof(value) * nLines);

  if (!valuesPtr) {
    puts("cannot allocate memory");
    return -1;
  }

  if((fptr = fopen("energy.txt", "r")) == NULL)
  {
    perror("Error opening file");
    return -1;
  }

  for(int i = 0; i < nLines; i++ )
  {
      if (fscanf(fptr, "%249s %249s %d",
                 valuesPtr[i].start_vertex,
                 valuesPtr[i].destination_vertex,
                 &valuesPtr[i].num) != 3) {
        printf("errored file line %d\n", i);
        break;
      }

      printf("\nStart vertex: %s \nDestination vertex: %s \nWeight: %d\n\n",
             valuesPtr[i].start_vertex, valuesPtr[i].destination_vertex, valuesPtr[i].num);
  }
  free(valuesPtr);
  fclose(fptr);

  return 0;
}

能量文件中包含以下内容

York    Hull    60
Leeds   Doncaster   -47
Liverpool   Nottingham  161
Manchester  Sheffield   61
Reading Oxford  -43
Oxford  Birmingham  103
Birmingham  Leicester   63
Liverpool   Blackpool   79
Carlisle    Newcastle   92
Nottingham  Birmingham  77
Leeds   York    39
Glasgow Edinburgh   74
Moffat  Carlisle    65
Doncaster   Hull    76
Northampton Birmingham  90
Leicester   Lincoln 82
Sheffield   Birmingham  122
Lincoln Doncaster   63
Sheffield   Doncaster   29
Bristol Reading 130
Hull    Nottingham  145
Blackpool   Leeds   116
Birmingham  Bristol 139
Manchester  Leeds   64
Carlisle    Blackpool   140
Leicester   Northampton -61
Newcastle   York    135
Glasgow Moffat  -28
Leicester   Sheffield   100
Carlisle    Liverpool   -30
Birmingham  Manchester  129
Oxford  Bristol 116
Leeds   Hull    89
Edinburgh   Carlisle    154
Nottingham  Sheffield   61
Liverpool   Manchester  56
Carlisle    Glasgow 50
Sheffield   Lincoln 74
York    Doncaster   55
Newcastle   Edinburgh   177
Leeds   Sheffield   53
Northampton Oxford  68
Manchester  Carlisle    20

总共有21个城市(节点),文件中的每一行显示了从一个城市移动到另一城市(边缘)所需的能量。我想将数据保存到一个矩阵中,以便以后进行进一步的计算。

c adjacency-matrix
1个回答
0
投票

如果要在数组中存储值,请创建数组,然后将值复制到其中。

  int num[nLines];
  char start_vertex[nLines][250];
  char destination_vertex[nLines][250];

复制数据,您可以使用strcpy()将字符串复制到c中的字符串

for(int i = 0; i < nLines; i++ ) {
   if (fscanf ...
   ...
   num[i] = valuesPtr[i].num;
   strcpy(start_vertex[i], valuesPtr[i].start_vertex);
   strcpy(destination_vertex[i], valuesPtr[i].destination_vertex);
   ...
}

© www.soinside.com 2019 - 2024. All rights reserved.