4 OrderNode *allocOrderNode(uint64_t id) {
5 OrderNode *This = (OrderNode *) ourmalloc(sizeof(OrderNode));
7 This->inEdges = allocHashSetOrderEdge(HT_INITIAL_CAPACITY, HT_DEFAULT_FACTOR);
8 This->outEdges = allocHashSetOrderEdge(HT_INITIAL_CAPACITY, HT_DEFAULT_FACTOR);
9 This->status = NOTVISITED;
14 void addNewIncomingEdge(OrderNode *node, OrderEdge *edge) {
15 ASSERT(!containsHashSetOrderEdge(node->inEdges, edge)); // Only for testing ... Should be removed after testing
16 addHashSetOrderEdge(node->inEdges, edge);
19 void addNewOutgoingEdge(OrderNode *node, OrderEdge *edge) {
20 ASSERT(!containsHashSetOrderEdge(node->outEdges, edge));
21 addHashSetOrderEdge(node->outEdges, edge);
24 void deleteOrderNode(OrderNode *node) {
25 deleteHashSetOrderEdge(node->inEdges);
26 deleteHashSetOrderEdge(node->outEdges);