Collision Detection
Collision Detection
Collision Detection
SHOW LESS
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Efficient Pair Management In hash table we store pointer to first pair in thehash collision chain (length k) – should be as smallas possible. When k > K (constant) we resize hashtable (rehash all pairs). Operations are O(k)=O(1)ID 1Hash tableID 2 (ID1 , ID 2) hash(ID 1,ID 2)Pair arrayVirtual ID pair matrixHash collision chain
Change language