renamed to avoid generic file name typedefs.h
authorGengbin Zheng <gzheng@upcrc1.cs.uiuc.edu>
Tue, 27 Apr 2010 15:13:07 +0000 (10:13 -0500)
committerGengbin Zheng <gzheng@upcrc1.cs.uiuc.edu>
Tue, 27 Apr 2010 15:13:07 +0000 (10:13 -0500)
src/conv-ldb/graphdefs.h [new file with mode: 0644]

diff --git a/src/conv-ldb/graphdefs.h b/src/conv-ldb/graphdefs.h
new file mode 100644 (file)
index 0000000..b021d85
--- /dev/null
@@ -0,0 +1,37 @@
+/*****************************************************************************
+ * $Source$
+ * $Author$
+ * $Date$
+ * $Revision$
+ *****************************************************************************/
+
+#include "converse.h"
+
+typedef struct {int node1, node2;} Edge;
+
+typedef struct {int next; 
+        Edge * edges;} EdgeListType;
+
+typedef struct {
+  int degree; 
+  int next; /* temporary count needed to tell where to insert the next entry */
+  int adjListInd; /* where in the big array does its adj list begin */
+  /*  int available;*/ /* number of connections still available. 12/2/97 */
+} Vertex;
+
+typedef struct {
+  int numVertices;
+  Vertex * vertexArray; /* ptr to an array of records, one for each vertex */
+  int * adjArray; /* ptr to an array in which adjacency sub-arrays for each 
+                    vertex are stored contiguosly */
+} VerticesListType;
+
+#define connections(graph, i) (graph->vertexArray[i].degree)
+
+/* -----*/
+typedef struct {
+  int size, head, tail;
+  int numElements;
+  int * buf; }
+ Q;
+