Cyberfilm specifications for generalized graph search algorithms

A multimedia programming approach for the generalized graph search (traversal) algorithms is considered. It is based on a concept of cyberFilm, which is a set of multi-media frames defining algorithmic features. Through these frames, the user can represent computational steps and specify "activity" within the steps. Each set of multimedia frames, represented by a special icon, is supported by a set of template programs to generate corresponding executable codes. Such icons and sets of template programs behind them provide powerful repetitive-type constructs for specifying computational algorithms.The main contributions of this paper are an introduction of a cyberFilm developed for the generalized graph search algorithms and a description of the template programs supporting this cyberFilm.

[1]  Sartaj Sahni,et al.  A parallel matching algorithm for convex bipartite graphs and applications to scheduling , 1984, J. Parallel Distributed Comput..

[2]  Rentaro Yoshioka,et al.  A Multimedia System to Render and Edit Self-explanatory Components , 2002 .

[3]  John T. Stasko,et al.  Algorithm Animation - Introduction , 2001, Software Visualization.

[4]  A.P. Black.  Post-Javaism [object-oriented languages] , 2004, IEEE Internet Computing.

[5]  Gennaro Costagliola,et al.  A framework for modeling and implementing visual notations with applications to software engineering , 2004, TSEM.

[6]  Shi-Kuo Chang,et al.  Visual Languages: A Tutorial and Survey , 1986, IEEE Software.

[7]  Steven Skiena,et al.  LINK : a system for graph computation , 2000 .

[8]  Marc H. Brown,et al.  Algorithm animation , 1988 .

[9]  Nikolay N. Mirenkov,et al.  Visual computing within environment of self-explanatory components , 2002, Soft Comput..

[10]  Robert Sedgewick,et al.  Algorithms in C , 1990 .

[11]  Nikolay N. Mirenkov,et al.  A visual representation of cellular automata-like systems , 2004, J. Vis. Lang. Comput..

[12]  Nikolay N. Mirenkov,et al.  Self-Explanatory Components: A New Programming Paradigm , 2001, Int. J. Softw. Eng. Knowl. Eng..

[13]  Nikolay N. Mirenkov,et al.  Multimedia representation of matrix computations and data , 2002, Inf. Sci..

[14]  Jeremy G. Siek,et al.  The Boost Graph Library - User Guide and Reference Manual , 2001, C++ in-depth series.

[15]  John Domingue,et al.  Software visualization : programming as a multimedia experience , 1998 .

[16]  Raimund Seidel,et al.  Algorithm animation using shape analysis: visualising abstract executions , 2005, SoftVis '05.