Star Pupil vs DijkstraGraph

Star Pupil is a practice aid for learning Celestial Navigation. It does not merely produce the answers to sight reductions but rather shows all the steps along the way! Traditional Celestial Navigation is straightforward and requires only a Nautical Almanac, Sight Reduction Tables, and basic arithmetic. However each step must be performed correctly, and small errors, like adding rather than subtracting, are easy to make. Star Pupil sharpens your traditional Celestial Navigation skills by showing each calculation and each step along the way for performing a Sight Reduction and plotting a Line of Position. Star Pupil shows all the calculations and steps for: * Calculating Ha from Hs using a Nautical Almanac * Performing a sight reduction for the Sun and Planets using Pub 229 * Performing a sight reduction for Stars using either Pub 229 or Pub 249 * Plotting LOPs for the Sun, Planets, and Stars * Plotting multiple LOPs to get a fix Additionally, Star Pupil shows the steps for finding twilight at your position, and looking up the best stars for taking sights using Publication 249 Volume 1.

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