linked list issue

[momotaro]

originaly am using these structers to impliment my graph:

 typedef struct _edge edge; 
 
typedef struct _vertex vertex;
 
 
 
struct _edge
 
{
 
char CarId[10];
 
int distance;
 
edge *NextEdge;
 
};
 
struct _vertex
 
{
 
char CarId[10];
 
int x,
 
y;
 
vertex *NextVertex;
 
edge *NextEdge;
 
};
 
 

how should i buil my 2D linked list to build the graph ?

[Ganon11]

I would have each vertex have a set of edges (maybe in a linked list of edges?) that lead away from that vertex, and have each edge hold a Vertex *to, Vertex *from, and int weight variable. Your current implementation looks like it will be messy.

[momotaro]

my ides is to read the first vertex and then its adjacency list then link the previous vertex to the next and redo the work...
basicaly the code will lay out like:

for(vertices)
{
add vertex
for(adjacency list starting from the next vertex in the file)
{
add edge
}
}

what do you think is it possible?

[momotaro]

what about this one:

 struct edge 
{
 
 
CarID[10]; 
 
int distance; 
 
edge *NextEdge; 
}; 
 
struct vertex 
 
 
{ 
 
CarID[10]; 
 
int x, 
 
y; 
 
edge *E; 
 
vertex *NextVertex; };