Hello thanks for this library :)
Do you think we could somehow abstract the [state] type for result paths?
If I'm not mistaken it could be a Monoid, Foldable instance, or possibly a custom Path typeclass with a predefined instance for [].
I'm thinking it might be helpful if the found path is to be reversed after it was found (and therefore couldve been constructed in a different order using for example :<| :|> from Data.Sequence), or within a monadic context some specialized type other than [state].
Hello thanks for this library :)
Do you think we could somehow abstract the
[state]type for result paths?If I'm not mistaken it could be a Monoid, Foldable instance, or possibly a custom Path typeclass with a predefined instance for
[].I'm thinking it might be helpful if the found path is to be reversed after it was found (and therefore couldve been constructed in a different order using for example :<| :|> from Data.Sequence), or within a monadic context some specialized type other than
[state].search-algorithms/src/Algorithm/Search.hs
Line 601 in 8defc3f