Filmification of methods: A visual language for graph algorithms

  • Authors:

  • Yutaka Watanobe;Nikolay N. Mirenkov;Rentaro Yoshioka;Oleg Monakhov

  • Affiliations:

  • Graduate Department of Information Systems, University of Aizu, Aizu-Wakamatsu, Fukushima 965-8580, Japan;Graduate Department of Information Systems, University of Aizu, Aizu-Wakamatsu, Fukushima 965-8580, Japan;Graduate Department of Information Systems, University of Aizu, Aizu-Wakamatsu, Fukushima 965-8580, Japan;Institute of Computational Mathematics and Mathematical Geophysics, Russian Academy of Science, Siberian Division, Lavrentieva 6, Novosibirsk 630090, Russia

  • Venue:
  • Journal of Visual Languages and Computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

A novel approach for using the filmification of methods concept in the graph algorithm representation, specification, and programming is considered. It is based on a ''cyberFilm'' format, where a set of multimedia frames represents algorithmic features. A brief description of the cyberFilm concept and an observation of graph algorithm features are presented. A number of cyberFilms related to Prim's and Dijkstra's algorithms have been developed and used to explain the basic ideas of the approach. Several versions of the algorithm visualization are demonstrated by corresponding examples of cyberFilm frames and icon language representations. In addition, a method for program generation from the cyberFilm specification is provided with explanations of program templates supporting the cyberFilm frames.