Hi,
Can anyone help me with this problem.
I am going to store a graph in a linked adjacency list, (cities and distance between them) and I am taking in the city input first. I am having trouble moving on to the next vertexnode(incrementing) to add the cities to the linked list. I can see this because I only get the last one I entered to display.
My structure looks like this:
struct arcnode{
char vertex[10];
int weight;
struct arcnode *nextarc;
};
struct vertexnode{
char city[10];
struct vertexnode *nextvertex;
struct arcnode *nextarc;
};
Anyone any ideas, much appreciated.
Thanks
Colin