Skip to content

Fix ml files and add algorithms#14342

Open
M-H-Jishan wants to merge 5 commits intoTheAlgorithms:masterfrom
M-H-Jishan:fix-ml-files-and-add-algorithms
Open

Fix ml files and add algorithms#14342
M-H-Jishan wants to merge 5 commits intoTheAlgorithms:masterfrom
M-H-Jishan:fix-ml-files-and-add-algorithms

Conversation

@M-H-Jishan
Copy link

Describe your change:

  • Add an algorithm?
  • Fix a bug or typo in an existing algorithm?
  • Add or change doctests? -- Note: Please avoid changing both code and tests in a single pull request.
  • Documentation change?

Checklist:

  • I have read CONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized.
  • I know that pull requests will not be merged if they fail the automated tests.
  • This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
  • All new Python files are placed inside an existing directory.
  • All filenames are in all lowercase characters with no spaces or dashes.
  • All functions and variable names follow Python naming conventions.
  • All function parameters and return values are annotated with Python type hints.
  • All functions have doctests that pass the automated testing.
  • All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
  • If this pull request resolves one or more open issues then the description above includes the issue number(s) with a closing keyword: "Fixes #ISSUE-NUMBER".

M-H-Jishan and others added 4 commits March 6, 2026 23:59
- Fix 4 broken machine learning files using deprecated sklearn functions
  - Replace plot_confusion_matrix with ConfusionMatrixDisplay.from_estimator
  - Replace load_boston with fetch_california_housing dataset
  - Add proper type hints and comprehensive doctests

- Fix FIXME issues in bipartite graph checker
  - Add input validation for invalid graph structures
  - Raise ValueError for disconnected nodes
  - Update type hints to support generic hashable types
  - Fix filename typo: check_bipatrite.py -> check_bipartite.py

- Add new algorithms with educational value
  - Trie-based autocomplete system with frequency ranking
  - B-Tree implementation for database-like operations
  - Rabin-Karp string search with multiple pattern support

All new code includes comprehensive doctests and follows project guidelines.
- Fix B-Tree split method to store median key before modifying keys list
- Fix B-Tree traverse method to handle child nodes correctly
- Fix Trie delete method to properly return False for non-existent words
- Update bipartite graph checker to remove overly strict validation
- All doctests now pass successfully
- Fix ambiguous minus sign in B-Tree docstring
- Import Hashable from collections.abc instead of typing
- Remove unused numpy import from gaussian_naive_bayes.py
- Prefix unused fig variables with underscore in ML files
- Rename unused loop variable i to _i in rabin_karp_search.py
- Combine nested if statements in rabin_karp_search.py

All ruff checks now pass for contributed files.
@algorithms-keeper algorithms-keeper bot added enhancement This PR modified some existing files require descriptive names This PR needs descriptive function and/or variable names require tests Tests [doctest/unittest/pytest] are required labels Mar 6, 2026
Copy link

@algorithms-keeper algorithms-keeper bot left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Click here to look at the relevant links ⬇️

🔗 Relevant Links

Repository:

Python:

Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.

algorithms-keeper commands and options

algorithms-keeper actions can be triggered by commenting on this PR:

  • @algorithms-keeper review to trigger the checks for only added pull request files
  • @algorithms-keeper review-all to trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.

NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.

self.children: list[BTreeNode] = []
self.is_leaf = is_leaf

def split(self, parent: BTreeNode, index: int) -> None:

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

As there is no test file in this pull request nor any test function or class in the file data_structures/binary_tree/b_tree.py, please provide doctest for the function split

words_with_freq: list[tuple[str, int]] = []
self._collect_words_with_frequency(node, prefix.lower(), words_with_freq)

words_with_freq.sort(key=lambda x: (-x[1], x[0]))

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please provide descriptive name for the parameter: x

@algorithms-keeper algorithms-keeper bot added awaiting reviews This PR is ready to be reviewed tests are failing Do not merge until tests pass labels Mar 6, 2026
Change 'hel' to 'hell' and 'help' in doctests and examples to avoid
codespell flagging it as a typo.
Copy link

@algorithms-keeper algorithms-keeper bot left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Click here to look at the relevant links ⬇️

🔗 Relevant Links

Repository:

Python:

Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.

algorithms-keeper commands and options

algorithms-keeper actions can be triggered by commenting on this PR:

  • @algorithms-keeper review to trigger the checks for only added pull request files
  • @algorithms-keeper review-all to trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.

NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.

self.children: list[BTreeNode] = []
self.is_leaf = is_leaf

def split(self, parent: BTreeNode, index: int) -> None:

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

As there is no test file in this pull request nor any test function or class in the file data_structures/binary_tree/b_tree.py, please provide doctest for the function split

words_with_freq: list[tuple[str, int]] = []
self._collect_words_with_frequency(node, prefix.lower(), words_with_freq)

words_with_freq.sort(key=lambda x: (-x[1], x[0]))

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please provide descriptive name for the parameter: x

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

awaiting reviews This PR is ready to be reviewed enhancement This PR modified some existing files require descriptive names This PR needs descriptive function and/or variable names require tests Tests [doctest/unittest/pytest] are required tests are failing Do not merge until tests pass

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant