注意:我不能使用'。和“->”运算符。这就是为什么我使用这些宏。

对于以下图表声明(我无法更改-分配,所以请不要问我任何关于它的声明),

#include <stdio.h>
#include <stdlib.h>
#define TAG(vp)   ((vp)->tag)
#define LABEL(vp) ((vp)->label)
#define EDGE(vp)  ((vp)->edge)

typedef struct vertex
{
    char tag; /* can be used for any puproses; haven't used though */
    char *label;
    struct vertex *edge[1];
}
vertex, *vp;


我编写了以下结构和函数,以创建图的邻接表。

typedef struct adjList
{
    vp node;
    struct adjList *next;
}
adjList;


void createList (adjList *list, vp graph, int *place) /* place stores an index in an array of adjacency lists */
{
    int i, temp = *place;
    adjList *ptr;
    if (graph)
    {
        list[temp].node = graph;
        list[temp].next = NULL;
        if (EDGE (graph))
        {
            ptr = list[temp].next;
            for (i = 0; EDGE (graph)[i]; ++i)
            {
                ptr = malloc (sizeof (adjList));
                ptr->node = EDGE (graph)[i];
                ptr = ptr->next;
            }
        }
        ++(*place);
        list = realloc (list, sizeof (adjList) * (*place + 1));
        for (i = 0; EDGE (graph)[i]; ++i)
        {
            createList (list, EDGE (graph)[i], place);
        }
    }
}


使用此主程序,我会遇到分段错误。

int main()
{
    int i;
    int *temp = malloc (sizeof (int));
    adjList *list, *ptr;
    vp test;
    *temp = 0; /* temp is an index starting from 0 */
    test = malloc (sizeof (*test) + 4 * sizeof (vp));
    list = malloc (sizeof (adjList));
    LABEL (test) = malloc (sizeof (char));
    LABEL (test)[0] = 'a';
    for (i = 0; i < 3; ++i)
    {
        EDGE (test)[i] = malloc (sizeof (vertex));
    }
    LABEL (EDGE (test)[0]) = malloc (sizeof (char));
    LABEL (EDGE (test)[0])[0] = 'b';
    LABEL (EDGE (test)[1]) = malloc (sizeof (char));
    LABEL (EDGE (test)[1])[0] = 'c';
    LABEL (EDGE (test)[2]) = malloc (sizeof (char));
    LABEL (EDGE (test)[2])[0] = 'd';
    EDGE (EDGE (test)[0])[0] = NULL;
    EDGE (EDGE (test)[1])[0] = NULL;
    EDGE (EDGE (test)[2])[0] = NULL;
    EDGE (test)[3] = NULL;
    printf ("%d\n", sizeof (EDGE (test)) / sizeof (vp));
    createList (list, test, temp);
    list = realloc (list, sizeof (adjList) * (*temp));
    printf ("%c\n", LABEL (test)[0]);
    printf ("%d\n", (test == list[0].node));
    for (ptr = list; ptr; ptr = ptr->next)
    {
        printf ("%c ", LABEL (ptr->node)[0]);
    }
    printf ("\n");
    return 0;
}


在调试它时,我发现创建邻接表的函数甚至没有将指针存储在“ adjList”结构中。也许我没有正确分配内存。任何帮助将不胜感激。

提前致谢。

最佳答案

在Mac OS X上运行,我收到消息:

graph(70806) malloc: *** error for object 0x7fb211c03b20: pointer being realloc'd was not allocated


使用createList()函数的此带注释的版本:

static
void createList (adjList *list, vp graph, int *place) /* place stores an index in an array of adjacency lists */
{
    int i, temp = *place;
    adjList *ptr;
    if (graph)
    {
        printf("-->> %s()\n", __func__);
        list[temp].node = graph;
        list[temp].next = NULL;
        if (EDGE (graph))
        {
            ptr = list[temp].next;
            for (i = 0; EDGE (graph)[i]; ++i)
            {
                ptr = malloc (sizeof (adjList));
                ptr->node = EDGE (graph)[i];
                ptr = ptr->next;
            }
        }
        ++(*place);
        printf("About to realloc() in createList()\n");
        list = realloc (list, sizeof (adjList) * (*place + 1));
        printf("Back from realloc() in createList()\n");
        for (i = 0; EDGE (graph)[i]; ++i)
        {
            printf("Recursing in createList\n");
            createList (list, EDGE (graph)[i], place);
            printf("Back from recursive createList\n");
        }
        printf("<<-- %s()\n", __func__);
    }
}


运行的输出为:

1
-->> createList()
About to realloc() in createList()
Back from realloc() in createList()
Recursing in createList
-->> createList()
About to realloc() in createList()
Back from realloc() in createList()
<<-- createList()
Back from recursive createList
Recursing in createList
-->> createList()
About to realloc() in createList()
graph(70904) malloc: *** error for object 0x7fefca403b20: pointer being realloc'd was not allocated
*** set a breakpoint in malloc_error_break to debug


麻烦在于createList()重新分配传入的list,但不能告诉调用代码新列表的地址。您将需要修改createList()以返回新列表,或者需要安排将adjList **list传递给函数-不管哪种情况,都需要进行相应的更改。

关于c - C:来自图的邻接列表-段错误,我们在Stack Overflow上找到一个类似的问题:https://stackoverflow.com/questions/16885861/

10-11 22:09