Hi all,
I need some advise about the program that I am going to write. I'll try to explain it briefly. There is going to be an array, such as ;
[ 0 1 2 3 4 5 6]
and each array element going to have a link list(separate link lists).
My first question is; is that possible?If it is, could you explain it briefly with a simple language?If it is not possible, what alternatives do I have?
The image that I added is a example of what I want to do.
Thanks from now.
“Example isn't another way to teach, it is the only way to teach” Albert Einstein
So it's an array of linked list pointers.
Code:struct llTag { int payload; struct llTag *next; }; struct llTag *adjacency[7] = { 0 };
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
If it only goes upto 7 then yes, otherwise a linked list of linked list pointers.
Thanks for the replies. I will try to give more information about the question that I am going to solve. The user will specify the number of vertices. For example: 7.
In the numerical order of verices(0-1-2...7), the user is going to declare the number of out going edges, then vertex number + edge weight. After getting these information, the program going to find the shortest path distances.
I thought I can create a array by the number of vertices from the user as a input and create separate link lists for each element of the array.Then after that I can find the shortest path.
So this is the question and the idea that I have to solve. If you could give me some hints I would really appreciate it.
Last edited by BoneXXX; 05-22-2007 at 10:44 PM.
“Example isn't another way to teach, it is the only way to teach” Albert Einstein
Seems like you have the right idea - go for it
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
