Hi everyone, does anyone know how i might implement a 2D Vote table? Would using a 2D array for it be possible? I'm trying to implement a voting system for the indexes into hash table arrays. Any ideas?
Im doing a project on geometric hashing aite. So now all the protein structures are hashed by having all the coordinates indexed into a hash table, (its a lot more than that but roughly this), all the elements in the same grid square form a linked list (i'm using sorted list), so then, now the objective is to implement a voting system for all model structures compared with the query structure so that we know which models have the highiest similarity with the queries. I'm suppose to implement a 2D vote table but I am not sure how to go about.
Suppose we have a hash table (seperate chaining method) meaning each cell contains a linked list of elements. How do I implement a counter so that everytime an element gets indexed into a cell, there's an increment in the counter. And at the end establish a result of the cell with the highiest number of indexes. I need a rough idea how to do that.