You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
As long as the algorithm is happy with the underlying data structure used in tree.hh, you can do what you like. For some algorithms it may be useful to do a single conversion of the data structure to something else, and then convert back, but that really depends on the details of what you want to do. Can you be a bit more specific about what you are after?
Is it possible to use this library with a custom algorithm like A*, minmax, etc?
Or is one forced to use pre-order, etc.?
Thank you
The text was updated successfully, but these errors were encountered: