-
-
Notifications
You must be signed in to change notification settings - Fork 46.1k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Suffix Tree Data Structure Implementation #11555
Conversation
for more information, see https://pre-commit.ci
for more information, see https://pre-commit.ci
…d_tree/example_usage.py
…d_tree/hypercube_points.py
for more information, see https://pre-commit.ci
…into feature/kd-tree-implementation # Conflicts: # data_structures/kd_tree/nearest_neighbour_search.py
for more information, see https://pre-commit.ci
for more information, see https://pre-commit.ci
for more information, see https://pre-commit.ci
Co-authored-by: Christian Clauss <cclauss@me.com>
Co-authored-by: Christian Clauss <cclauss@me.com>
Co-authored-by: Christian Clauss <cclauss@me.com>
…dtree() to include various checks.
for more information, see https://pre-commit.ci
…into feature/kd-tree-implementation # Conflicts: # data_structures/kd_tree/tests/test_kdtree.py
for more information, see https://pre-commit.ci
for more information, see https://pre-commit.ci
Closing this pull request as invalid@Ramy-Badr-Ahmed, this pull request is being closed as none of the checkboxes have been marked. It is important that you go through the checklist and mark the ones relevant to this pull request. Please read the Contributing guidelines. If you're facing any problem on how to mark a checkbox, please read the following instructions:
NOTE: Only |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Fixed, got it reopened : #11554
Describe your change:
This pull request adds an implementation of the Suffix Tree data structure along with related functionalities, such as pattern searches.
Definition: The Suffix Tree is a compressed trie of all the suffixes of a given text used for for substring search and various other string-processing operations. (URL: Suffix Tree).
Implementation Details:
suffix_tree_node.py
: Defines theSuffixTreeNode
class, representing nodes in the suffix tree.build_suffix_tree.py
: Builds a suffix tree from the given text and apply pattern searche for a pattern in the built suffix tree.Example Usage:
example_usage.py
: Demonstrates how to use the Suffix Tree implementation with a predefined text and searches for various patterns.Unit Tests:
test_suffix_tree.py
: Validates the correctness of the Suffix Tree implementation, including tests for building the tree and searching for patterns.