Suffix Tree Data Structure Implementation#11555
Closed
Uh oh!
There was an error while loading. Please reload this page.
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
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 theSuffixTreeNodeclass, 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.