This project provides a Python implementation to construct and visualize a suffix tree for a given string. Suffix trees are useful in various applications, such as string matching, data compression, and bioinformatics. The visualizer uses matplotlib
to render the tree structure.
- Suffix Tree Construction: Implements Ukkonen's algorithm to build a suffix tree.
- Visualization: Generates a graphical representation of the suffix tree using
matplotlib
. - Interactive Input: Enter a word to visualize its suffix tree.
- Python 3.11 π
- Required libraries:
matplotlib
-
Clone the repository and navigate to the project folder.
-
Run the Python script:
python suffix_tree_visualizer.py
-
Enter a word or string when prompted. ex - banana.
-
The suffix tree for the input will be visualized using
matplotlib
.
Contributions, issues, and feature requests are welcome! Feel free to fork the repository and submit a pull request.
For any questions, feel free to reach out via email: [urlanasureshkumar@gmail.com] βοΈ