Word Ladder Graph Solver 🕸️

A C++ application with a Qt graphical interface that finds the shortest transformation path between two words by changing one letter at a time.

Features

• Custom Graph Structure: Uses a templated graph with adjacency lists to map valid word transitions.
• Optimized Construction: Achieves highly efficient graph building by using STL maps and wildcard patterns instead of naive $O(n^2)$ pair comparisons.
• Pathfinding: Utilizes Breadth-First Search (BFS) to guarantee the shortest transformation sequence.
• Qt GUI: Includes a "Playing Mode" with real-time hints and an "Automatic Mode" for instant solving, backed by user analytics storage.

Tech Stack

• Language: C++, STL (vector, map, queue, set)
• Framework: Qt (Widgets, Signals & Slots)
• Concepts: Graph Theory, BFS Algorithm, Time Complexity Optimization.