A word ladder is a sequence of words in which two adjacent words differ by one letter. For example, in English, it is possible to go from head to tail in five steps: head --> heal --> teal --> tell --> tall --> tail. In Portuguese, we can go from tudo to nada in four: tudo --> todo --> nodo --> nado --> nada.
Tasks:
- Present a complete functionally correct implementation of the hash table, including code that dynamically resizes the hash table array when more stuff is added to the hash table.
- Build the graph (including union-find data).
- Implement breadth-first search in the graph.
- List all words belonging to a connected component.
- Find the shortest path between to words.
- Compute the diameter of a connected component and list the longest word chain.
- Print some statistics about the graph
- Test for memory leaks
jnluis / project_aed2 Goto Github PK
View Code? Open in Web Editor NEWThis project forked from dianarrmiranda/project_aed2
AED 2022/23- Project 2