C - 나는 두 구조체 만든

Question

포인터 삽입 알고리즘 :

typedef struct mainNode { 
    int theNode; 
    int visited; 
    struct mainNode *next; 
} node_rec, *node_ptr; 

및

typedef struct neighborNode { 
    struct neighborNode *next; 
} neighbor_node_rec, *neighbor_node_ptr; 

나는 목록에 삽입해야합니다

void insert(node_ptr head, int theNodeVal, int neighborNodeVal, int weight) { 

//if list is empty 
if (head == NULL) { 
    head = (node_ptr) malloc(sizeof (node_rec)); //create head of list 
    head->theNode = theNodeVal; //set head value to node value 
    head->next = NULL; //point to null  
} 

//while list is not pointing no null 
while (head != NULL) { 
    //if node IS NOT equal to node value 
    if (head->theNode != theNodeVal) { 
     head->theNode = theNodeVal; //set head value (new node) to node value 
     head->next = tail; //connect to next node 
     tail->next = NULL; //point to null 
    } 
    else 
    {   
     //if node IS equal to node value (the node already exists) 
     tail->next = head // head is the new tail 
     head->neighbor = n; //point at the neighbor of head (new tail) 
    } 
} 
} 

내가하려고 해요을 내가 구현 한 논리가 올바른지 확인하십시오. 이것이 내가 모든 라인에 주석을다는 이유이다. 페이지 상단의 링크를 참조하여 시각적으로 볼 수 있습니다.

Answer 1

if (head->theNode = theNodeVal) {을 if (head->theNode == theNodeVal) {으로 바꿉니다. 도움이 될까요?

#include <limits.h> 
#include <string.h> 
#include <malloc.h> 
#include <stdio.h> 

struct Vertex { 
    struct Vertex *next; // The reference to the next vertex in the global list of vertices 
    int nodeId; 
    int distance; 
    struct Vertex *previous; // The reference to trace back the shortest path; 
    struct Edge *neighbor; // The reference to the list of edges of this 
}; 

struct Edge { 
    struct Edge *next; // The reference to the next edge of this vertex; 
    struct Vertex *node; // The reference to the vertex at other end of this edge; 
    int weight; 
}; 


struct Vertex *head = NULL; 

struct Vertex *newVertex(int nodeId) { 
    struct Vertex *p = malloc(sizeof(struct Vertex)); 
    memset(p,0,sizeof(struct Vertex)); 
    p->nodeId = nodeId; 
    p->distance=INT_MAX; 
    p->next = head; 
    head = p; 
    return p; 
} 

void addEdge(struct Vertex *v1, struct Vertex *v2, int weight) { 
    struct Edge *e = malloc(sizeof(struct Edge)); 
    e->next = v1->neighbor; 
    v1->neighbor = e; 
    e->node = v2; 
    e->weight = weight; 
} 

void insert(int node1, int node2, int weight) { 
    struct Vertex *current = head, *p1 = NULL, *p2 = NULL; 

    while (current != NULL) { 
     if (current->nodeId == node1) p1 = current; 
     if (current->nodeId == node2) p2 = current; 
     current = current->next; 
    } 

    if (p1 == NULL) p1 = newVertex(node1); 
    if (p2 == NULL) p2 = newVertex(node2); 

    addEdge(p1,p2,weight); 
    addEdge(p2,p1,weight); 
} 

void main(int argc, char **argv) { 
    int node1, node2, weight; 
    while (EOF != scanf("%d %d %d \n", &node1, &node2, &weight)) { 
     insert(node1, node2, weight); 
    } 
}