Path Finding Visualization vs Vectors and Planes

Want to see various pathfinding algorithms in action? With Path Finding Visualization, you can visualize, in action, six different algorithms. This app allows you to select your own starting and ending points, select the algorithm you want to use, and add walls in order to create boundaries. This app includes the following algorithms: Dijkstra's - Works by expanding outwards until it reaches the target node. Guaranteed to find the shortest path as long as there are not any negative weights. Bidirectional Dijkstra's - Dijkstra's algorithm from both sides. A* - Like Dijkstra's in that it favors nodes close to the starting point, but also favors nodes close to the ending point (heuristic). It does not guarantee the shortest path. A tie-breaker that prefers straight lines was included in order to prevent multiple nodes from having the same F values. Bidirectional A* - The A* algorithm from both sides. Breadth-First Search - Traverses through a graph one level at a time until it finds the target node. Since there are no weights, this algorithm does guarantee the shortest path. Depth-First Search - Traverses through a graph by going as deep as possible and then backtracking until it finds the target node. It does not guarantee the shortest path. Learning about or want to visualize any of the above algorithms in action? Download Path Finding Visualization today and have a better understanding of how each algorithm works.

Vectors and Planes App helps visualize and understand 3D linear and quadric structures and their intersections. List of linear structures and combinations: 1. Two vector combination. 2. Plane. 3. Line and plane combination. 4. Two plane combination. 5. Three plane combination. Current list of quadric structures: 1. Two sphere combination. 2. Standard ellipsoid. 3. Ellipsoid in a form of positive-definite matrix. 4. Standard cone. 5. Cone in a form of indefinite matrix. 6. 1-sheet hyperboloid. 7. 1-sheet hyperboloid in a form of indefinite matrix. 8. 2-sheet hyperboloid. 9. 2-sheet hyperboloid in a form of indefinite matrix. 10. Standard cylinder. 11. Cylinder in a form of positive-semidefinite matrix. 12. Hyperbolic paraboloid. 13. Elliptic paraboloid. Current list of combinations of quadric and linear structures: 1. Matrix ellipsoid and line. 2. Standard ellipsoid and plane. 3. Matrix ellipsoid and plane. 4. Matrix cone and line. 5. Standard cone and plane. 6. 1-sheet hyperboloid in matrix form and line. 7. 2-sheet hyperboloid in matrix form and line. 8. Matrix cylinder and line. 9. Elliptic paraboloid and line. 10. Hyperbolic paraboloid and line. Interactive 3D graphs are provided for all of the above. Step by step calculation algorithms are provided for all intersection point sets. Many of the algorithms are based on Linear Algebra concepts. Those, in turn, are explained in our “Matrix Solver Step by Step” app. Version 10 was completely redesigned. Developers hope to get feedback from users at graphmath@aol.com.