Fractal Catalog vs DijkstraGraph

In the “Fractal Catalog” iPhone/iPad app, you can see various fractal figures while moving them. ** Fractals handled in “Fractal Catalog” ** C Curve Sierpinski Gasket Sierpinski Carpet Pentaflake Hexaflake Sierpinski Curve Hilbert Curve Peano Curve Moore Curve Koch Curve Koch Snow Flake Gumowski Mira Attractor Julia Set Mandelbrot Set Cellular Automaton Pascal’s Triangle Barnsley Fern Dragon Curve Modified Koch Curve Tree Curve Z Order Curve Minkowski Sausage Vicsek Snow Flake Saltire Vicsek Snow Flake Cross Torn Square Fractal Cantor Set Cantor Dust Gosper Curve Gosper Curve N13 Affine Transformation IFS Ammonite Affine Transformation IFS Tree Affine Transformation IFS Twin Dragon Affine Transformation IFS Branch Affine Transformation IFS Fern 2 Chaos Game Random Walk & Levy Flight Diffusion Limited Aggregation Diffusion Limited Deposition Invasion Percolation Ballistic Aggregation Devil’s Staircase Eden Model Scheidagger River Net

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