•Search the Hash
•Read a number/word
•From the user
•Find the position for this number/word
•in the graph (vertical array of nodes)
•By dividing with N or similar
•Check if any vertex node is there
•In that array position (array of graph vertices)
•If no vertex is there
•The word is not in the hash
•If a vertex is there
•Match with the vertex label, if matched you found the word/number
•If no match with the vertex labels
•traverse through the edges
•Until you find a match
•How to Build
•Build the Hash
•Read a number/word from file
•Find the position for this number/word
•in the graph (vertical array of nodes)
•By dividing with N or similar
•Check if any vertex node is there
•In that array position (array of graph vertices)
•If no vertex is there
•Create a vertex node, assign the number/word to that node
•Insert into that position
•If a vertex is there
•If no edge so far, create an edge node, assign number/word
•Else: traverse through the edges
•Go to the end of the edge list
•Create an edge vertex, assign the number/word to that edge node
•
