implementing graph using linked list

[Tim]

Anybody knows how can I implement graph using linked list? I get the idea at the abstract level, and I know how to do it using arrays, but I don't know how to write the code using linked list.

I'd really appreciate it.
Thanks

[oscar]

You would need to use a linked list for each node. The linked lists are used to store the edges that connect from the node in question to another node.

The simplest way to store the nodes would be in an array, unless of cause you need to be flexible and then you would also use a linked list to store the nodes.

The following structure variables should be a start:

struct NODE_S
{
struct LINKED_LIST_S *edges;
};

struct LINKED_LIST_S
{
int node;
struct LINKED_LIST_S *next;
};

struct NODE_S nodeArray[??];


I would also suggest the following functions as a start:

/* simply add the node to the array of nodes */
int add_node ()

/* add an item to the linked list for this node */
int add_node_edge ()