This directory contains Python implementations of common graph-based algorithms and data structures.
- Adjacency List Implementation: Implements the Graph Abstract Data Type (ADT) using an adjacency list (dictionaries in Python). Includes
VertexandGraphclasses. - Breadth First Search (BFS): Implements BFS to solve the Word Ladder problem, finding the shortest transformation path between words.
- General Depth First Search (DFS): Provides a general implementation of DFS, including discovery and finish times for vertices.
- DFS - Knight's Tour Problem: Another implementation of DFS specifically tailored to the Knight's Tour puzzle.
- The Knight's Tour Problem: Focuses on generating the knight's move graph and solving the tour using DFS and backtracking.
- Word Ladder Problem: Specifically focuses on building the word ladder graph where edges connect words that differ by only one letter.