---

The main motivation behind this site is as a teaching aid in the field of algorithms and data-structures.  A series of applets, including algorithm pseudocode, are provided to illustrate the workings of important algorithms in Computer Science.

• Start Chrome web browser.
  
• Go to  https://chrome.google.com/webstore/detail/cheerpj-applet-runner/bbmolahhldcbngedljfadjlognfaaein?hl=en . 
  
• Install "cheerpj-applet-runner",
  
• Go to the AAW legacy and open one of the animation applets.
• Click on the "puzzle piece" near the top right corner of the browser (which says "Extensions").  Give Cheerpj full permission.
  
• Now the AAW animation apps should be fully functional.
  

DICTIONARIES:

• Optimal Static Binary Search Tree            (by Roman Gubarenko, 2005) 
  

GRAPHS:

• Dijkstra - Single Source Shortest Paths     (by Hai Feng Huang, 2005) 
  
• Minimum Spanning Tree                             (by Dena Ghiassi, 2005) 
  
• Max-Flow Min-Cut                                      (by Hai Feng Huang, 2006. Haoyuan Wang & Xianwang Wang, 2003) 
  
• Traveling Salseman Problem                       (by Leonardo Zambito, 2006) 
  

This page was initially developed during the winter of 2001 as part of a project course for the Department of Computer Science at York  University by Sotirios Stergiopoulos and Hang Thi Anh Pham under the supervision of Andranik Mirzaian. Later on, other students have contributed additional animations to this page.

        We strongly encourage interested students to contribute more applets to our page  ( some topics are listed  here  ). 
        For any contributions, comments, or  questions,  please contact Andranik Mirzaian.