Computing and Information Technology Interactive Digital Educational Library


Computer Science Teaching Center >
Computer Science Teaching Center >

Please use this identifier to cite or link to this item:

Title: A New and More Efficient Implementation of an Undirected Graph Component
Authors: Weide, Bruce
Long, Tim
Bucci, Paolo
Europa research group
Craft, Shawn
Keywords: Software sub_subject: Programming Techniques Software sub_subject: Software Engineering Data sub_subject: Data Structures Data sub_subject: Data Storage Representations Theory of Computation sub_subject: Analysis of Algorithms and Problem Complexity graphs, components, software engineering, software reuse
Issue Date: 22-Apr-2001
Abstract: This research project entails designing, specifying, coding, testing, debugging, and documenting different implementations of an undirected graph component for the RESOLVE/C++ Component Catalog. Each version uses the same abstract model to represent the state of an undirected graph and the same kernel operations to manipulate the state of that undirected graph. The implementation strategy changes for each version. The first five versions utilize the "classic" strategies (adjacency list, adjacency matrix, and edge list) in a variety of ways. The final version employs a novel data structure
Other Identifiers: 138
Appears in Collections:Computer Science Teaching Center

Files in This Item:

File Description SizeFormat
SIGCSE Poster.ppt52KbMicrosoft PowerpointView/Open
SIGCSE Revised Presentation.ppt.description0KbUnknownView/Open
SIGCSE Poster.ppt.description0KbUnknownView/Open
SIGCSE Revised Presentation.ppt104KbMicrosoft PowerpointView/Open

All items in DSpace are protected by copyright, with all rights reserved.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback