TMR Memory Test vs DijkstraGraph

TMR Memory Test application is used for conducting targeted memory reactivation (TMR) experiment in education purposes. Newly acquired information is stabilized into long-term memory through the process of consolidation. Memories are not static; rather, they are constantly updated via reactivation, and this reactivation occurs preferentially during Slow-Wave Sleep. This application uses method called targeted memory reactivation, whereby auditory cues that were previously associated with learning are re-presented during sleep, triggering recall of stored memories and through this strengthening these memories.

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