Cyberfilm specifications for generalized graph search algorithms

Authors:
Yutaka Watanobe;Nikolay N. Mirenkov;Rentaro Yoshioka
Affiliations:
Graduate Department of Information Systems, University of Aizu, Aizu-Wakamatsu, Japan;Graduate Department of Information Systems, University of Aizu, Aizu-Wakamatsu, Japan;Graduate Department of Information Systems, University of Aizu, Aizu-Wakamatsu, Japan
Venue:
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
Year:
2006

Citing 11
Cited 0

LINK: a system for graph computation

Software—Practice & Experience - Special issue on discrete algorithm engineering
The boost graph library: user guide and reference manual

The boost graph library: user guide and reference manual
Modern Compiler Implementation in C

Modern Compiler Implementation in C
Algorithms in C

Algorithms in C
Multimedia representation of matrix computations and data

Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Intelligent multimedia computing and networking
Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation

LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Algorithm Animation - Introduction

Revised Lectures on Software Visualization, International Seminar
Post-Javaism

IEEE Internet Computing
A framework for modeling and implementing visual notations with applications to software engineering

ACM Transactions on Software Engineering and Methodology (TOSEM)
Algorithm animation using shape analysis: visualising abstract executions

SoftVis '05 Proceedings of the 2005 ACM symposium on Software visualization
Visual Languages: A Tutorial and Survey

IEEE Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.