EVEGA: an educational visulalization environment for graph algorithms

Authors:
Sami Khuri;Klaus Holzapfel
Affiliations:
Dept of Math and Computer Science, San José State University, San José, CA;Institut für Informatik, Technische Universität München, D-80290 München, Germany
Venue:
Proceedings of the 6th annual conference on Innovation and technology in computer science education
Year:
2001

Citing 3
Cited 3

Introduction to algorithms

Introduction to algorithms
Improving discrete mathematics and algorithms curricula with LINK

Proceedings of the 2nd conference on Integrating technology into computer science education
On Implementing Push-Relabel Method for the Maximum Flow Problem

On Implementing Push-Relabel Method for the Maximum Flow Problem

Algorithm Animation - Introduction

Revised Lectures on Software Visualization, International Seminar
Teaching graph algorithms using online java package IAPPGA

ACM SIGCSE Bulletin
Scripted Collaboration to Leverage the Impact of Algorithm Visualization Tools in Online Learning: Results from Two Small Scale Studies

International Journal of e-Collaboration

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes the package EVEGA (Educational Visualization Environment for Graph Algorithms) and possible ways of incorporating it into the teaching of algorithms. The tool is freely available, platform- and network-independent, and highly interactive. The tool is designed for three different groups of users: students, instructors, and developers. Interaction with EVEGA can be achieved through the exploration of existing default visualizations, through the direct manipulation of graphical objects, or through the implementation and visualization of new algorithms using existing classes.