OrderNode *allocOrderNode(uint64_t id) {
OrderNode *This = (OrderNode *) ourmalloc(sizeof(OrderNode));
This->id = id;
- This->inEdges = allocHashSetOrderEdge(HT_INITIAL_CAPACITY, HT_DEFAULT_FACTOR);
- This->outEdges = allocHashSetOrderEdge(HT_INITIAL_CAPACITY, HT_DEFAULT_FACTOR);
+ This->inEdges = new HashSetOrderEdge();
+ This->outEdges = new HashSetOrderEdge();
This->status = NOTVISITED;
This->sccNum = 0;
return This;
}
void addNewIncomingEdge(OrderNode *node, OrderEdge *edge) {
- ASSERT(!containsHashSetOrderEdge(node->inEdges, edge)); // Only for testing ... Should be removed after testing
- addHashSetOrderEdge(node->inEdges, edge);
+ node->inEdges->add(edge);
}
void addNewOutgoingEdge(OrderNode *node, OrderEdge *edge) {
- ASSERT(!containsHashSetOrderEdge(node->outEdges, edge));
- addHashSetOrderEdge(node->outEdges, edge);
+ node->outEdges->add(edge);
}
void deleteOrderNode(OrderNode *node) {
- deleteHashSetOrderEdge(node->inEdges);
- deleteHashSetOrderEdge(node->outEdges);
+ delete node->inEdges;
+ delete node->outEdges;
ourfree(node);
}