
What is it aboutKeywords: Algorithm animation, Visualization, Data Structures Astral is a programming environment for the production of algorithm and data structure animations focused on teaching. This environment was initially developed between 19951997 in the Institute of Computing at UNICAMP (State University of Campinas) for MacOS. Between 20012003, it was ported to MSWindows and extended. The use of Astral in undergraduate courses proved to be a valuable especially in teaching programming and algorithms. Key Benefits
References
What is availableAnimations of the following data structures are available: Arrays, Linked Lists, Doubly Linked Lists, Binary Search Trees, AVL Trees, B Trees, Hash Tables. Moreover, animations of the following algorithms have also been implemented: Sorting (Heap Sort, Insertion Sort, Merge Sort, Quick Sort, Selection Sort, Shell Sort), String Alignments, and Operations on Grammars. Furthermore, a Graph Editor and algorithms for several graph theoretical problems are available. Among these: Depth First Search, Breadth First Search, Topological Sorting, Minimum Cost Spanning Tree (Kruskal & Prim), Shortest Paths (Dijkstra), Maximum Flow Network (FordFulkerson), Matching (on bipartite graphs). A number of applications are available. See below.
License Terms
Download
Contact InformationIf you have questions not answered in these pages, feel free to contact us. However, we should point out that all the documentation we have available is posted here as soon as it becomes available.

