Polyhedron and Polyhedra Vol.2 vs DijkstraGraph

Polyhedron and Polyhedra Volume 2 is a collection of 4 kepler-poinsot polyhedra, 53 uniform star polyhedra, their duals and polyhedral compounds of them. This is also an application which helps you to learn about or explore these mathematical solids. Without knowledge of mathematics or polyhedron, you can easily interact with the 3d solids by this application. So, you will become more familiar with the polyhedrons, and you may enjoy these abstract solids as fascinating formative arts. The main advantage of this app is that it offers a large variety of polyhedral compounds of identical uniform star polyhedra and their duals. By choosing a model, and by setting colors and parameters optionally, you will find various types of 3d shapes including wonderful shapes, mysterious artistic shapes, and strange eccentric shapes, which will be interesting for you. Features: - Swipe or touch gesture will rotate, zoom or move the object. So, you can observe it from various angles or positions. (You can observe it even from inside.) - Switches between showing and hiding each face of the polyhedron, and switches between showing and hiding each component of the compound - Function to display the edges of the polyhedra with selectable thickness and color - For each kepler-poinsot polyhedron, each uniform star polyhedron and each dual of uniform star polyhedron, the app can provide the compound from 14 to 22 kinds (more than 1200 in total). - Many color patterns for the faces of the polyhedron. - Functions to display basic informations about the polyhedron, and to access the wikipedia sites about the related items - Slider controllers to reduce z-fighting (screen flicker) - Save PNG images to camera roll

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