{"id":599,"date":"2026-02-26T12:48:36","date_gmt":"2026-02-26T12:48:36","guid":{"rendered":"https:\/\/ffritze.de\/?p=599"},"modified":"2026-04-21T20:48:07","modified_gmt":"2026-04-21T20:48:07","slug":"knopfnavigator-dijkstra-unplugged","status":"publish","type":"post","link":"https:\/\/ffritze.de\/en\/knopfnavigator-dijkstra-unplugged\/","title":{"rendered":"Button Navigator - Dijkstra unplugged"},"content":{"rendered":"

The Dijkstra algorithm is an efficient method for determining the shortest path in a graph. It is widely used in networks, route planners, and many applications in computer science. Due to its ability to find optimal solutions, it plays a central role in graph theory and data analysis.<\/p>\n\n\n\n\n\n\n\n

Instructions for Use: Button Navigator \u2013 Dijkstra Unplugged<\/h2>\n\n\n\n
    \n
  1. Prepare materials<\/strong>: You will need several buttons to serve as nodes, as well as strings to represent the edges between the nodes.<\/li>\n<\/ol>\n\n\n\n
    \n
    \n
      \n
    1. Create graph<\/strong>: Connect the buttons with the strings by tying them in knots. Each knot represents a point in the graph, and the strings show the connections between these points.<\/li>\n<\/ol>\n<\/div>\n\n\n\n
      \n
      \"Gedruckter\n\t\t\t\n\t\t\t\t\n\t\t\t<\/svg>\n\t\t<\/button>
      Strings knotted with button<\/figcaption><\/figure>\n<\/div>\n<\/div>\n\n\n\n
        \n
      1. Select starting point<\/strong>: Lift the button (or a string at any point) that represents the starting point. This signals that you want to find the shortest path to your destination.<\/li>\n<\/ol>\n\n\n\n
        \n
        \n
          \n
        1. Visualize path<\/strong>: The cords will adjust, and the connected buttons hanging in a line downward will indicate the shortest path to the destination.<\/li>\n<\/ol>\n\n\n\n
            \n
          1. Discuss results<\/strong>: Discuss the discovered paths and the functionality of the Dijkstra algorithm using the visual representation.<\/li>\n<\/ol>\n<\/div>\n\n\n\n
            \n
            \"Gedruckte\n\t\t\t\n\t\t\t\t\n\t\t\t<\/svg>\n\t\t<\/button>
            The cord can be clamped into the target for fastening.<\/figcaption><\/figure>\n<\/div>\n<\/div>\n\n\n\n

            This method allows for a vivid and interactive explanation of the Dijkstra algorithm without technical aids.<\/p>\n\n\n\n

            \n
            \"Der\n\t\t\t\n\t\t\t\t\n\t\t\t<\/svg>\n\t\t<\/button>
            The graph as a zoo map<\/figcaption><\/figure>\n<\/div>\n\n\n\n
            \n
            \n

            Modeling the graph as a map, for example of a zoo, particularly increases children\u2019s motivation to engage with the Dijkstra algorithm. Through the visual representation, children can better understand the various nodes and paths. In addition, signposts and thematic elements present the problem in a playful way, making learning both entertaining and educational.<\/p>\n<\/div>\n\n\n\n

            \n
            \"Gedruckter\n\t\t\t\n\t\t\t\t\n\t\t\t<\/svg>\n\t\t<\/button>
            The signpost motivates finding the shortest path.<\/figcaption><\/figure>\n<\/div>\n<\/div>\n\n\n\n
            <\/div>\n\n\n\n
            \n

            Note on 3D Models<\/h3>\n\n\n\n

            The parts for the button navigator are available as 3D models for download. You can access them via the following links:<\/p>\n\n\n\n