程序应生成一个图并将其邻居存储在邻接列表中。解析列表时,我得到一个SEGFAULT
。这很奇怪,因为当我尝试逐个访问列表时,它可以正常工作。链接列表错误(语言:C)
我的代码:
int main(void)
{
typedef struct linkedList{
int vertice;
struct linkedList *next;
}LL;
typedef struct vertex{
int color;
int noOfNeighbours;
LL *adj;
}vertex;
int E, V;
scanf ("%d %d", &V, &E);
//printf ("%d %d", E, V);
int i, j; //loop variables
vertex arrOfVertices [V];
for (i=0; i<V; i++)
{
arrOfVertices[i].color=-1;
arrOfVertices[i].noOfNeighbours=-1;
arrOfVertices[V].adj = NULL;
}
printf ("Output is : \n");
int firstV, secondV;
for (i=0; i<E;i++)
{
scanf ("%d %d", &firstV, &secondV);
LL* temp = malloc (sizeof(LL));
temp -> vertice = secondV-1;
if (arrOfVertices[firstV-1].adj == NULL)
{
arrOfVertices[firstV-1].adj=temp;
arrOfVertices[firstV-1].adj->next=NULL;
}
else
{
temp->next=arrOfVertices[firstV-1].adj;
arrOfVertices[firstV-1].adj=temp;
}
}
//Printing the list function. This part strangely segfaults and I don't know why
for (j=0; j<V;j++)
{
LL* parser = arrOfVertices[j].adj;
// printf ("%d : Color: %d\n", i+1, arrOfVertices[i].color);
while (parser!=NULL)
{
printf ("%d\n", parser->vertice);
parser = parser->next;
}
}
return 0;
}
int firstV,secondV;似乎没有初始化,使用时没有赋值? –
@Jerry_Y'scanf()',假设它有效,应该算作* something *。 – WhozCraig
实际上并不重要,因为测试用例提供了E的值,并且它恰好具有E行。 –