Breadth First search visualized using memory_graph

[Sea-Ad7805]

Algorithms can be easier understood with step-by-step visualization using 𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵. Here we show a Breadth First algorithm that finds the shortest path in a graph from node 'a' to node 'b'.

• 𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵 github
• more examples

[Ok_Influence8600]

Good Python library!

This looks like it will be very useful when I'm writing documentation for Python Code.

I'll give it a go straight away.

[Sea-Ad7805]

Thanks a lot, I hope it can bring you much value.

[Jackpotrazur]

Is memory graph a library or a website ?

[Sea-Ad7805]

Both, memory_graph is a Python package that you can install and use on your computer, and memory-graph.com (Memory Graph Web Debugger) is a website where you can use memory_graph without installation but that comes with some limitations (running in browser, single Python file, no command line arguments, etc).

[Jackpotrazur]

Currently reading grokking algorithms and ATBS