Graph Traversals with Breadth-First Search in Rust
Yet another video on my channel in the Algorithms/Graphs in Rust series:
One of the basic building blocks in graph algorithms, breadth-first search also makes for a good demo.
This time, I used egui library to make the demo. It was overall a pleasant experience, and I intend to explore the library a bit more before writing down / talking about it.