Danila Fedorin
01d49eb397
In order to efficiently check if nodes are contained within a given set, without knowing exactly how many nodes there are and allocating a ton of memory, it's probably best to use a hash table (sparse sets would be more efficient but would require to allocate all of their space at once). It's also pointless to reimplement most of the hash table functionality from libds just to get it to work with pairs (pattern id + node id), so pairmap.h provides a few defaults that can be plugged into the default ht_s, as well as a few macros to facilitate some hash table operations. |
||
|---|---|---|
| .. | ||
| main.c | ||
| pairmap.c | ||
| pattern.c | ||