home.social

#memory_graph — Public Fediverse posts

Live and recent posts from across the Fediverse tagged #memory_graph, aggregated by home.social.

fetched live
  1. Two different Binary Tree implementations side by side:
    memory-graph.com/#codeurl=http

    🔗 Binary Tree as Nodes
    Built out of multiple node objects. Each node stores its value and two references, one to its left child and one to its right child.

    📦 Binary Tree as List
    A single list or array. Instead of references, indices represent the relationships between nodes. For a node at index, its children can be found using a simple calculation.

    Which would you use?

  2. The difference in Python OOP between:
    - instance method
    - class method
    - static method
    visually explained using 𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵: memory-graph.com/#codeurl=http

  3. An exercise to help build the right mental model for Python data.
    - Solution: memory-graph.com/#codeurl=http
    - Explanation: github.com/bterwijn/memory_gra

    The “Solution” link visualizes execution and reveals what’s actually happening using 𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵: lnkd.in/e3sUM7wG

  4. Ever wondered what a Trie actually looks like in memory?

    A Trie is a tree of dictionaries, often used for problems like:
    - prefix search
    - word completion
    - spell checking
    - sequence matching

    Package 𝐦𝐞𝐦𝐨𝐫𝐲_𝐠𝐫𝐚𝐩𝐡 can show how data structures like Trie grow step by step. Instead of only reading code, you can see data structures being built in memory.

    Run the live demo: memory-graph.com/#codeurl=http

    More 𝐦𝐞𝐦𝐨𝐫𝐲_𝐠𝐫𝐚𝐩𝐡 examples: linkedin.com/groups/13244150/

  5. An exercise to help build the right mental model for Python data.
    - Solution: memory-graph.com/#codeurl=http
    - Explanation: github.com/bterwijn/memory_gra

    The “Solution” link visualizes execution and reveals what’s actually happening using 𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵: github.com/bterwijn/memory_gra

  6. How does Radix Sort work?

    Algorithms like Radix Sort: memory-graph.com/#codeurl=http
    are much easier to understand when you can see every intermediate step.

    Using 𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵: github.com/bterwijn/memory_gra
    you can watch how Radix Sort repeatedly applies stable Counting Sort, sorting the least significant digit up to the most significant digit in turn.

    Radix Sort is be very efficient, with time complexity O(n · d), where 'n' is the number of values and 'd' is the number of digits.

  7. 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': memory-graph.com/#codeurl=http

    𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵 github: github.com/bterwijn/memory_gra

  8. An exercise to help build the right mental model for Python data.
    - Solution: memory-graph.com/#codeurl=http
    - Explanation: github.com/bterwijn/memory_gra

    The “Solution” link visualizes execution and reveals what’s actually happening using 𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵: lnkd.in/e3sUM7wG

  9. Data Structures in Python get easy when you can simply see the structure of your data using 𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵. A Hash_Set example: memory-graph.com/#codeurl=http

    𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵: github.com/bterwijn/memory_gra

  10. An exercise to help build the right mental model for Python data.
    - Solution: memory-graph.com/#codeurl=http
    - Explanation: github.com/bterwijn/memory_gra

    The “Solution” link visualizes execution and reveals what’s actually happening using 𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵: github.com/bterwijn/memory_gra

  11. An exercise to help build the right mental model for Python data.
    - Solution: memory-graph.com/#codeurl=http
    - Explanation: github.com/bterwijn/memory_gra

    The “Solution” link uses 𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵 to visualize execution and reveals what’s actually happening.

  12. An exercise to help build the right mental model for Python data.
    - Solution: memory-graph.com/#codeurl=http
    - Explanation: github.com/bterwijn/memory_gra

    The “Solution” link uses 𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵 to visualize execution and reveals what’s actually happening.

  13. An exercise to help build the right mental model for Python data. The “Solution” link uses 𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵 to visualize execution and reveals what’s actually happening:
    - Solution: memory-graph.com/#codeurl=http
    - Explanation: github.com/bterwijn/memory_gra

  14. Understanding a data structure like linked list in Python is a lot easier when you can just see it. Linked_List demo: memory-graph.com/#codeurl=http

    𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵 visualizes Python objects and references, so data structures stop being abstract and become something you can debug with ease. No more endless print-debugging. No more stepping through 50 frames just to find one sneaky reference/aliasing mistake.

  15. Understanding a data structure like linked list in Python is a lot easier when you can just see it. Linked_List demo: memory-graph.com/#codeurl=http

    𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵 visualizes Python objects and references, so data structures stop being abstract and become something you can debug with ease. No more endless print-debugging. No more stepping through 50 frames just to find one sneaky reference/aliasing mistake.

    #Python #programming #memory_graph

  16. An exercise to help build the right mental model for Python data. The “Solution” link uses memory_graph to visualize execution and reveals what’s actually happening:
    - Solution: memory-graph.com/#codeurl=http
    - Explanation: github.com/bterwijn/memory_gra

  17. Teaching data structures in Python gets easier with 𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵 visualizations. Data structures are no longer abstract concepts but concrete, clear and easy to debug.

    Hash_Map demo: memory-graph.com/#codeurl=http

    This Hash_Map (Hash_Table) is a Python implementation similar to 'dict'. The demo visualizes:
    - adding key–value pairs
    - rehashing
    - lookup by key
    - iterating over keys

  18. Teaching data structures in Python gets easier with 𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵 visualizations. Data structures are no longer abstract concepts but concrete, clear and easy to debug.

    Hash_Map demo: memory-graph.com/#codeurl=http

    This Hash_Map (Hash_Table) is a Python implementation similar to 'dict'. The demo visualizes:
    - adding key–value pairs
    - rehashing
    - lookup by key
    - iterating over keys

    #Python #programming #memory_graph

  19. An exercise to help build the right mental model for Python data. The “Solution” link uses memory_graph to visualize execution and reveals what’s actually happening:
    - Solution: memory-graph.com/#codeurl=http
    - Explanation: github.com/bterwijn/memory_gra

  20. Four options for 𝐂𝐨𝐩𝐲 in Python:

    𝚒𝚖𝚙𝚘𝚛𝚝 𝚌𝚘𝚙𝚢

    𝚍𝚎𝚏 𝚌𝚞𝚜𝚝𝚘𝚖_𝚌𝚘𝚙𝚢(𝚊):
    ... 𝚌 = 𝚊.𝚌𝚘𝚙𝚢()
    ... 𝚌[𝟷] = 𝚊[𝟷].𝚌𝚘𝚙𝚢()
    ... 𝚛𝚎𝚝𝚞𝚛𝚗 𝚌

    𝚊 = [[𝟷, 𝟸], [𝟹, 𝟺]]
    𝚌𝟷 = 𝚊
    𝚌𝟸 = 𝚊.𝚌𝚘𝚙𝚢()
    𝚌𝟹 = 𝚌𝚞𝚜𝚝𝚘𝚖_𝚌𝚘𝚙𝚢(𝚊)
    𝚌𝟺 = 𝚌𝚘𝚙𝚢.𝚍𝚎𝚎𝚙𝚌𝚘𝚙𝚢(𝚊)

    c1, 𝐚𝐬𝐬𝐢𝐠𝐧𝐦𝐞𝐧𝐭: nothing is copied, everything is shared
    c2, 𝐬𝐡𝐚𝐥𝐥𝐨𝐰 𝐜𝐨𝐩𝐲: first value is copied, underlying is shared
    c3, 𝐜𝐮𝐬𝐭𝐨𝐦 𝐜𝐨𝐩𝐲: you decide what is copied and shared
    c4, 𝐝𝐞𝐞𝐩 𝐜𝐨𝐩𝐲: everything is copied, nothing is shared

    see: memory-graph.com/#breakpoints=

  21. Four options for 𝐂𝐨𝐩𝐲 in Python:

    𝚒𝚖𝚙𝚘𝚛𝚝 𝚌𝚘𝚙𝚢

    𝚍𝚎𝚏 𝚌𝚞𝚜𝚝𝚘𝚖_𝚌𝚘𝚙𝚢(𝚊):
    ... 𝚌 = 𝚊.𝚌𝚘𝚙𝚢()
    ... 𝚌[𝟷] = 𝚊[𝟷].𝚌𝚘𝚙𝚢()
    ... 𝚛𝚎𝚝𝚞𝚛𝚗 𝚌

    𝚊 = [[𝟷, 𝟸], [𝟹, 𝟺]]
    𝚌𝟷 = 𝚊
    𝚌𝟸 = 𝚊.𝚌𝚘𝚙𝚢()
    𝚌𝟹 = 𝚌𝚞𝚜𝚝𝚘𝚖_𝚌𝚘𝚙𝚢(𝚊)
    𝚌𝟺 = 𝚌𝚘𝚙𝚢.𝚍𝚎𝚎𝚙𝚌𝚘𝚙𝚢(𝚊)

    c1, 𝐚𝐬𝐬𝐢𝐠𝐧𝐦𝐞𝐧𝐭: nothing is copied, everything is shared
    c2, 𝐬𝐡𝐚𝐥𝐥𝐨𝐰 𝐜𝐨𝐩𝐲: first value is copied, underlying is shared
    c3, 𝐜𝐮𝐬𝐭𝐨𝐦 𝐜𝐨𝐩𝐲: you decide what is copied and shared
    c4, 𝐝𝐞𝐞𝐩 𝐜𝐨𝐩𝐲: everything is copied, nothing is shared

    see: memory-graph.com/#breakpoints=

    #Python #programming #memory_graph

  22. An exercise to help build the right mental model for Python data. The “Solution” link uses memory_graph to visualize execution and reveals what’s actually happening:
    - Solution: memory-graph.com/#codeurl=http
    - Explanation: github.com/bterwijn/memory_gra

  23. Visualization of Python execution can help beginners to understand how their program state changes over time and to debug any remaining issues.

    For example, a classic intro-course exercise — computing which coins to use to pay an amount using a greedy approach:
    memory-graph.com/#codeurl=http

  24. Visualization of Python execution can help beginners to understand how their program state changes over time and to debug any remaining issues.

    For example, a classic intro-course exercise — computing which coins to use to pay an amount using a greedy approach:
    memory-graph.com/#codeurl=http

    #Python #programming #memory_graph

  25. An exercise to help build the right mental model for Python data. The “Solution” link uses memory_graph to visualize execution and reveals what’s actually happening:
    - Solution: memory-graph.com/#codeurl=http
    - Explanation: github.com/bterwijn/memory_gra

  26. Algorithms like Cocktail Shaker Sort: lnkd.in/e5e7FUeu
    (Bubble Sort in both directions) are easier to understand after visualization using memory_graph: lnkd.in/ePFhkAfH

    #Python #programming #memory_graph #sort

  27. Here’s Selection Sort running with memory_graph. You can see the updating of `min_value` and the swaps of list elements in each step. Run a one-click live demo in Memory Graph Web Debugger: memory-graph.com/#codeurl=http
    Visual feedback like this helps beginners grasp what the code does and debug with confidence.

    #python #programming #memory_graph #sort

  28. Teaching and learning Python data structures gets much easier when you can see the structure of your data in real time using the open-source memory_graph package. Here is a 'Binary Tree' example:
    memory-graph.com/#codeurl=http

    #python #programming #memory_graph #BinaryTree

  29. A Sliding Puzzle Solver as a challenging demo in the Memory Graph Web Debugger. Click "Continue" to step through the breadth-first search generations until a solution path is found:

    memory-graph.com/#codeurl=http

    The visualization isn't flawless at this size, but memory_graph still provides real insight for program understanding and debugging, even as the graph grows large.

    #python #programming #memory_graph

  30. Understanding and debugging Data Structures is easier when you can see the structure of your data using memory_graph: github.com/bterwijn/memory_gra

    In this example we show values being inserted in a Binary Tree. When inserting the last value '29' we "Step Into" the code to show the recursive implementation: shorturl.at/bx848

    🎥 See the Quick Intro video for the VS Code integration: youtu.be/23_bHcr7hqo

    #Python #BinaryTree #Tree #DataStructure #memory_graph #debug