This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revision | Next revisionBoth sides next revision | ||
root:loadtext [2010/11/10 12:18] – nchiap | root:loadtext [2010/11/12 15:09] – nchiap | ||
---|---|---|---|
Line 7: | Line 7: | ||
- | === Dynamic | + | === Dynamic |
If you do not give the structure, the first line of your file must contain the tree definition | If you do not give the structure, the first line of your file must contain the tree definition | ||
Line 29: | Line 29: | ||
T-> | T-> | ||
T-> | T-> | ||
+ | </ | ||
+ | |||
+ | === Dynamic Tree Structure === | ||
+ | You can extend this idea to plot all histograms in an unknown tree. | ||
+ | The following code reads a tree form a datafile with a arbitrary number of columns | ||
+ | and creats a histogram for each of them. | ||
+ | |||
+ | <code C++> | ||
</ | </ |