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.
