Algorithms (VPP compatible) vs Path Finding Visualization

[ NOTE ] This version is intended for educational institutions and companies looking to purchase "Algorithms: Explained&Animated" using Volume Purchase Program (VPP). If you are new to "Algorithms: Explained&Animated", please search App Store for the free-to-download, original version. ==== Summary ==== Enjoy watching, trying, and learning with this guide to algorithms. The wide-ranging field of algorithms is explained clearly and concisely with animations. Deepen your understanding by exploring concepts in "Sim Mode". Also includes algorithms closer to home involving encryption and security. Come on, let's take a journey into the world of algorithms! ==== Categories and Included Topics ==== [ Sort ] Bubble Sort, Selection Sort, Insertion Sort, Heap Sort, Merge Sort, Quicksort [ Clustering ] k-means Algorithm [ List Search ] Linear Search, Binary Search [ Graph Search ] Breadth-First Search, Depth-First Search, Bellman-Ford, Dijkstra's Algorithm, A* algorithm [ Math ] Euclidian Algorithm, Primality Test [ Data Compression ] Run-Length Encoding, Huffman Coding [ Security ] Hash Functions, Shared-Key Cryptosystem, Public-Key Cryptosystem, Hybrid Cryptosystem, Diffie-Hellman Key Exchange, Message Authentication Codes, Digital Signatures, Digital Certificates [ Data Structures ] Lists, Arrays, Stacks, Queues, Hash Tables, Heaps, Binary Search Trees [ The Web ] PageRank [ Recursion ] Tower of Hanoi ==== On iPad ==== This app is also compatible for use on iPad, where it can be used in both horizontal and vertical orientations. ==== Supported languages ==== - English - Español (Spanish) - Português (Portuguese) - 中文 (简体字) (Chinese (Simplified)) - Русский (Russian) - 日本語 (Japanese) - 한국어 (Korean) The display language can be changed on the settings menu.

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.