Digital Elements vs DijkstraGraph

Euclid’s Elements stands as the most widely read mathematical treatise of all times. Delements is an innovative, digital and interactive edition of this monumental book, in modern Greek. By combining geometry, history of mathematics, as well as digital technology, Delements aims to provide high school students with a unique opportunity: (a) to reconstruct Euclid’s demonstrations through interactive diagrams; (b) to delve into historical insights about ancient mathematics; and (c) to cultivate software development skills. Delements includes: (a) The ancient Greek text of Euclid’s Elements from the edition by J. L. Heiberg. (b) Interactive diagrams for many propositions of Euclid's Elements. (c) Selected recordings of the ancient text as well as other audio-visual material. (d) Ideas for the pedagogical utilization of thematic units from the secondary education’s curriculum. This application is part of the project ‘Digital Elements’, which is supported by the Hellenic Foundation for Research and Innovation (H.F.R.I.) under the 3rd Call for ‘Science and Society’: Nodes of Research, Innovation, and knowledge diffusion. (F.N.: 2183). It is hosted by the Laboratory for the Electronic Processing of Historical Archives within the Department of History and Philosophy of Science at the National and Kapodistrian University of Athens. It is based on REPOX and GeoGebra.

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