feat: Implement Levenshtein distance and BFS

[monkey0722]

This pull request introduces implementations and corresponding test cases for two algorithms: Levenshtein Distance (edit distance) and Breadth-First Search (BFS). The changes include the addition of well-documented algorithm implementations and comprehensive test coverage to ensure correctness and handle edge cases.

Levenshtein Distance Algorithm:

• algorithms/dp/levenshtein-distance/levenshteinDistance.ts: Added a function to compute the Levenshtein distance between two strings using dynamic programming. The function calculates the minimum number of single-character operations (insertions, deletions, or substitutions) required to transform one string into another.
• algorithms/dp/levenshtein-distance/levenshteinDistance.test.ts: Added test cases to validate the correctness of the Levenshtein distance function, covering identical strings, empty strings, single operations, complex cases, and case sensitivity.

Breadth-First Search (BFS) Algorithm:

• algorithms/search/bfs/bfs.ts: Implemented the BFS algorithm to calculate the shortest path distances and predecessors for path reconstruction. Also added a helper function reconstructPath to reconstruct the shortest path from a source vertex to a target vertex using the BFS results.
• algorithms/search/bfs/bfs.test.ts: Added test cases for the BFS algorithm, covering scenarios such as simple graphs, disconnected graphs, invalid start vertices, single-vertex graphs, tree structures, cyclic graphs, and performance on large graphs. Also included tests for the reconstructPath function to validate correct path reconstruction and handling of unreachable vertices.

[Copilot]

Copilot reviewed 4 out of 4 changed files in this pull request and generated no comments.