This is a minimalistic, single-file implementation of a Priority Queue (minheap) in Mojo, largely mimicking Python's functionality. While I know the concept isn't new and that existing Mojo implementations have already been posted (e.g., toybox), I wrote this mostly for educational purposes to explore Mojo and its tooling.
I thought I'd share it in case others find it useful or interesting. Thanks for checking it out!