Bayan Flow 0.5.0: Tree Traversals, Graph Algorithms, and Turning a Visualizer Into a Platform

Version 0.5.0 of Bayan Flow has been released, marking the most significant update to date. The project, whose name means "clarity" in Arabic, aims to make algorithms that appear complex on a whiteboard feel intuitive once visualized. This version introduces six tree traversal algorithms, including Inorder, Preorder, Postorder for DFS, Level-order, Zigzag for BFS, and Morris Traversal, which can traverse a tree using O(1) extra space by temporarily rewiring right pointers.

Additionally, Bayan Flow now includes seven graph algorithms such as Topological Sort, Kahn's, Kruskal's, Prim's, Tarjan's, Kosaraju's, and Floyd-Warshall. Most graph algorithms render as node-link graphs, while Floyd-Warshall presents its results in a matrix view. The platform now features Google sign-in, saved favorites, study notes, a Pro waitlist, and an extensive infrastructure overhaul.

Account creation is now required, providing access to all 45 algorithms, manual stepping, custom speed settings, fullscreen mode, sound, video export, code panels, and insight panels. Users can save up to 20 algorithms as favorites and write notes on them, with all data synced through Supabase. The free tier offers limited access to 18 algorithms and 12 visualizations per session, while the Pro plan awaits a waiting list, with early sign-ups receiving a 50% discount on the lifetime price.

The release also includes various infrastructure changes, such as moving from Netlify to Cloudflare Workers, acquiring a domain (bayanflow.com), and migrating from Umami to PostHog for improved SEO.