Sorry, I meant:
Base.isless(s1::State, s2::State) = isless(s1.a, s2.a) || (s1.a == s2.a &&
isless(s1.b, s2.b))
On Friday, January 8, 2016 at 7:56:51 PM UTC+9, Kenta Sato wrote:
>
> The priority queue in Base is different from priority queues in other
> languages.
> I think you can use a plain
The priority queue in Base is different from priority queues in other
languages.
I think you can use a plain priority queue (or heap) defined the
DataStructures.jl package.
To pair priority and state, `priority => state` would be helpful. This
paired values are ordered by the first element (prio
