\u2022Search the Hash<\/p>\n\n\n\n
\u2022Read a number\/word<\/p>\n\n\n\n
\u2022From the user<\/p>\n\n\n\n
\u2022Find the position for this number\/word<\/p>\n\n\n\n
\u2022in the graph (vertical array of nodes)<\/p>\n\n\n\n
\u2022By dividing with N or similar<\/p>\n\n\n\n
\u2022Check if any vertex node is there<\/p>\n\n\n\n
\u2022In that array position (array of graph vertices)<\/p>\n\n\n\n
\u2022If no vertex is there<\/p>\n\n\n\n
\u2022The word is not in the hash<\/p>\n\n\n\n
\u2022If a vertex is there<\/p>\n\n\n\n
\u2022Match with the vertex label, if matched you found the word\/number<\/p>\n\n\n\n
\u2022If no match with the vertex labels<\/p>\n\n\n\n
\u2022traverse through the edges<\/p>\n\n\n\n
\u2022Until you find a match<\/p>\n\n\n\n
\u2022How to Build<\/strong><\/p>\n\n\n\n \u2022Build the Hash<\/p>\n\n\n\n \u2022Read a number\/word from file<\/p>\n\n\n\n \u2022Find the position for this number\/word<\/p>\n\n\n\n \u2022in the graph (vertical array of nodes)<\/p>\n\n\n\n \u2022By dividing with N or similar<\/p>\n\n\n\n \u2022Check if any vertex node is there<\/p>\n\n\n\n \u2022In that array position (array of graph vertices)<\/p>\n\n\n\n \u2022If no vertex is there<\/p>\n\n\n\n \u2022Create a vertex node, assign the number\/word to that node<\/p>\n\n\n\n \u2022Insert into that position<\/p>\n\n\n\n \u2022If a vertex is there<\/p>\n\n\n\n \u2022If no edge so far, create an edge node, assign number\/word<\/p>\n\n\n\n \u2022Else: traverse through the edges<\/p>\n\n\n\n \u2022Go to the end of the edge list<\/p>\n\n\n\n \u2022Create an edge vertex, assign the number\/word to that edge node<\/p>\n\n\n\n \u2022<\/p>\n","protected":false},"excerpt":{"rendered":" \u2022Search the Hash \u2022Read a number\/word \u2022From the user \u2022Find the position for this number\/word \u2022in the graph (vertical array of nodes) \u2022By dividing with N or similar \u2022Check if any vertex node is there \u2022In that array position (array of graph vertices) \u2022If no vertex is there \u2022The word is not in the hash … <\/p>\n