| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
| Name | Name | Last commit date | ||
|---|---|---|---|---|
The Optimal Binary Search Tree (OBST) project is a C++ application designed for constructing and analyzing OBSTs interactively via a Command-Line Interface (CLI). It minimizes search costs based on provided probabilities, ensuring an efficient structure for search operations. Users can create, edit, visualize, and analyze OBSTs, along with viewing derived cost tables and probabilities.
The CLI provides a user-friendly menu to navigate through the features:
Allows users to create or modify the OBST structure.
Prints the constructed OBST in a textual format, showing parent-child relationships for each node.
Generates a graphical representation of the OBST using Graphviz:
Provides insights into the tree:
Displays the dynamic programming tables used during OBST construction:
Shows the input data in a clean tabular format:
Terminates the program.
The project utilizes a custom Vector class for efficient dynamic array operations.
The Settings class allows users to customize tree visualization properties (e.g., node color, shape, font size) by modifying an external settings.txt file. It enables easy personalization and persists changes across sessions. For missing files, defaults are automatically generated. This integrates seamlessly into the Visualize Tree feature, enhancing the clarity and usability of tree representations.
Required for generating graphical representations of the OBST. The .dot files are processed into PNG.
Used for:
MIT License file are included in the source code, explore it for more details. 2024 Ain Shams University, Cairo, Egypt, All rights reserved.
| Back | FazBrowse Home | New Git URL |