Goldbach's Conjecture vs DijkstraGraph

Fun and Challenging! Goldbach's Conjecture introduces students to an idea that has baffled mathematicians for centuries. In 1742, a Russian mathematician named Christian Goldbach wrote a letter to Leonhard Euler in which he proposed a conjecture. The conjecture stated that all even numbers greater than two can be expressed as the sum of two primes. This app challenges the player to find two prime numbers to make a target even number. Completing the activity involves using mental math skills. Goldbach Conjecture is designed to be a quick math exercise that teachers can use to provide extra practice in problem solving and an enriching experience for their students. Special sound effects make the game fun to use and the interactive design facilitate problem solving strategies.

Learn, Play, and Explore graph theory and Dijkstra's shortest path algorithm with DijkstraGraph! Create and edit simple graphs and add edge weights. Rearrange the vertices and interact with the adjacency matrix to explore graph and matrix structure. Play through Dijkstra's shortest path algorithm step by step to identify a shortest path between two vertices. Play through the algorithm on the connected graph you create or explore one already created for you! Create and edit simple graphs - Add and delete vertices and edges - Add and edit weights on each edge - Rearrange vertices to explore graph Interact with the adjacency matrix - Tap on a vertex or edge to highlight corresponding rows and columns in adjacency matrix Play or Explore Dijkstra's shortest path algorithm - Play through Dijkstra's shortest path algorithm on the graph you create! - Or Explore the algorithm on a built in demo graph - Choose a start and end vertex then follow the instructions to step through the algorithm - Complete each step successfully to advance to the next part of the algorithm - After completing the algorithm, use the results to identify the shortest path Run - Don't have time to play through the algorithm?  - Choose a start and end vertex and run the algorithm to identify shortest path