#include #include #ifndef __LLADD_GRAPH_H #define __LLADD_GRAPH_H /*typedef struct { int outPage; ///<= number of links that leave this page. short inPage; ///<= number of links that stay within this page /// (represented as an array of shorts after the /// array of links leaving the page.) short flags; ///<= information about this node. (algorithm specific...) } nodeHeader_t; */ void naiveTraverse(int xid, recordid rid, int num); void multiTraverse(int xid, recordid arrayList, lladdFifo_t * local, lladdFifo_t * global, lladdFifoPool_t * pool, int num); void pushRequest(lladdConsumer_t * cons); #endif