00001 /***************************************************************************** 00002 * $Source: /cvsroot/charm/src/conv-ldb/typedefs.h,v $ 00003 * $Author: milind $ 00004 * $Date: 2000-03-02 11:36:35 $ 00005 * $Revision: 1.4 $ 00006 *****************************************************************************/ 00007 00008 #include "converse.h" 00009 00010 typedef struct {int node1, node2;} Edge; 00011 00012 typedef struct {int next; 00013 Edge * edges;} EdgeListType; 00014 00015 typedef struct { 00016 int degree; 00017 int next; /* temporary count needed to tell where to insert the next entry */ 00018 int adjListInd; /* where in the big array does its adj list begin */ 00019 /* int available;*/ /* number of connections still available. 12/2/97 */ 00020 } Vertex; 00021 00022 typedef struct { 00023 int numVertices; 00024 Vertex * vertexArray; /* ptr to an array of records, one for each vertex */ 00025 int * adjArray; /* ptr to an array in which adjacency sub-arrays for each 00026 vertex are stored contiguosly */ 00027 } VerticesListType; 00028 00029 #define connections(i) (graph.vertexArray[i].degree) 00030 00031 /* -----*/ 00032 typedef struct { 00033 int size, head, tail; 00034 int numElements; 00035 int * buf; } 00036 Q; 00037
1.5.1