The Matrix Mentor vs DijkstraGraph

Are matrices getting you down? Don’t worry… THE MATRIX MENTOR IS HERE TO HELP The Matrix Mentor provides a visual understanding of linear transformations. Where others may teach you the mathematical rules that can be hard to remember, our playground provides a visual and interactive demonstration of the inner workings. SCARED OF MATRICES? DON'T BE! At its core, The Matrix Mentor is a visual learning tool, designed to bring matrices from an abstract mathematical concept to a concrete application. Whether you think about vectors as 3D points or a RGB color value, the fundamentals hold true. - Experiment with different types of transformations - Discover how matrices interact with a given vector, or a whole grid of points - Develop your intuitive sense for reading matrices and linear transformations Do yourself a favour, and start playing with The Matrix Mentor today!

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