MiLABEx vs DijkstraGraph

MiLABEx™, Fourier Education’s mobile data analysis app for iOS devices, is based on Fourier’s award-winning MultiLab™ analysis software. MiLABEx unlocks a world of scientific experiments for teachers and students alike. Supported devices: einstein™ Tablet+ & einstein™ Tablet einstein™ LabMate+ & einstein™ LabMate™ Languages: English (en), Czech (cs), German (de), Spanish (es), French (fr), Hebrew (he/iw), Italian (it), Japanese (ja), Lithuanian (lt), Polish (pl), Portuguese (pt), Russian (ru), Slovak (sk), Ukrainian (uk), Chinese simplified (zh-rCN) ALBERT EINSTEIN and EINSTEIN are either trademarks or registered trademarks of The Hebrew University of Jerusalem. Represented exclusively by GreenLight. Official licensed merchandise. Website: einstein.biz © 2015 Fourier Systems Ltd. All rights reserved. Fourier Systems Ltd. logos and all other Fourier product or service names are registered trademarks or trademarks of Fourier Systems. All other registered trademarks or trademarks belong to their respective companies. Features: Intuitive and simple interface Professional data analysis tool Multiple data display modes: graphs, tables, meters and map Drag & drop window displays Real-time data measurements via built-in and external sensors Supports over 65 Fourier sensors Supports GPS for location based experiments Experiment note-taking feature Export and Share options ALBERT EINSTEIN and EINSTEIN are either trademarks or registered trademarks of The Hebrew University of Jerusalem. Represented exclusively by GreenLight. Official licensed merchandise. Website: einstein.biz © 2014 Fourier Systems Ltd. All rights reserved. Fourier Systems Ltd. logos and all other Fourier product or service names are registered trademarks or trademarks of Fourier Systems. All other registered trademarks or trademarks belong to their respective companies

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