Ternary Tree node depth statistics #85
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
Looks good, same comment as the last PR. Just needs a switch on the usage statement |
|
Usage updated. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
In order to analyze the tree structure, implementation changes and optimizations, it is very useful to see statistics on the tree, specifically the histogram of how many nodes are at each depth (path length) in the tree. Other than just looking at the numbers, this makes it easy to copy&paste the data into Matlab/Octave to make nice graphs for visualizing performance comparisons etc.
These commits add this functionality to the tree, print them out in the (already existing) performance tests, and add a command line option to print them out on any given input.