Storing Data into a Linked List C++

Question

The input is in the following format.

The first number is the number of vertexes in the graph. Then next lines up to 0 are the edges of the graph. With the first and second numbers being the vertexes and the third being how far the edge is between them. I can not figure out how to store the data into the List adjacency for each of the vertexes when reading it in. EX. Vertex 1 would have two List cells containing 2 9.0 and 3 12.0. I would also need to put the 1 9.0 and 1 12.0 into vertexes 2 and 3. But I can not figure out how to store the data into the ListCells

Code so Far:

#include <cstdio>
using namespace std;
typedef ListCell* List;

struct ListCell
{
   ListCell* next;
   int vertex;
   double weight;

   ListCell(int v, double w, ListCell* nxt)
   {
      vertex = v;
      weight = w;
      next = nxt;
   }
};

struct Vertex
{
   bool signaled;
   long distance;
   Vertex next;
   List adjacency;    
};

struct Graph
{
   int     numVertices;
   Vertex* vertexInfo;

   Graph(int n)
   {
      numVertices = n;
      vertexInfo  = new Vertex[n+1];
      for(int i = 1; i <= n; i++)
      {
         vertexInfo[i].signaled = false;
      }
   }
};

//==============================================================
//                   readIn
//==============================================================
// 
//==============================================================

void readIn()
{
   int n, p1, p2;
   double edge;
   scanf("%i ", &n);

   Graph(n);
   while(scanf("%i " &p1) != 0)
   {

   }
}

Maybe you should move the input functionality into the Graph class? — Thomas Matthews
– Thomas Matthews, Commented Mar 19, 2014 at 13:04

FabioDch · Accepted Answer · 2014-03-19 13:08:52Z

0

I use to define data structures in a way suitable for the business logic.

I would suggest you have a look on The Art of Computer programming to have an idea of some best practices.

Put an eye on "Linear Lists" chapter

hint: traverse the list and append the new node (please take care of corner cases):

Vertex* v = vertexInfo[i];
while (v->next!=null) {
   v = v->next;
}
v->next = new Vertex(....);

answered Mar 19, 2014 at 13:08

FabioDch

5144 silver badges8 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Storing Data into a Linked List C++

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related