src/conv-ldb/graphdefs.h

   1 #include "converse.h"
   2
   3 typedef struct {int node1, node2;} Edge;
   4
   5 typedef struct {int next;
   6          Edge * edges;} EdgeListType;
   7
   8 typedef struct {
   9   int degree;
  10   int next; /* temporary count needed to tell where to insert the next entry */
  11   int adjListInd; /* where in the big array does its adj list begin */
  12   /*  int available;*/ /* number of connections still available. 12/2/97 */
  13 } Vertex;
  14
  15 typedef struct {
  16   int numVertices;
  17   Vertex * vertexArray; /* ptr to an array of records, one for each vertex */
  18   int * adjArray; /* ptr to an array in which adjacency sub-arrays for each
  19                      vertex are stored contiguosly */
  20 } VerticesListType;
  21
  22 #define connections(graph, i) (graph->vertexArray[i].degree)
  23
  24 /* -----*/
  25 typedef struct {
  26   int size, head, tail;
  27   int numElements;
  28   int * buf; }
  29  Q;
  30