Java Graph Base [May 1998]
by David Goldschmidt
Project Advisor: Dr. Mukkai Krishnamoorthy
Rensselaer Polytechnic Institute
Computer Science Department
The fundamental objectives of this project may be summarized as follows:
This project has spanned about 4 months from January 1998 through
May 1998, and is my Masters Project for Rensselaer Polytechnic
Institute. The project links that follow consist of the actual
Masters Thesis, the standard
- Compared to the generic programming components provided by the
standard C++ Standard Template Library (STL), the standard Java 1.1
packages provide only a very limited set of generic container classes
and related generic programming components. As part of this project,
a more extensive Container package has been designed and
implemented under Java 1.1.
- The graph is one of the most useful and powerful data
structures in the field of Computer Science. The scope of this
data structure spreads well beyond the realm of Computer Science
and even academia; application areas include various fields of
science, neural network applications, electrical engineering,
operations research, sociology, communications and networking,
transportation systems, scheduling systems, simulation systems,
and so on. The primary advantage to using the graph data
structure is its flexibility.
Building upon the aforementioned Container package, the
Graph package provides a generic graph package that
abstracts the graph data structure and related algorithms in
documentation, the source code for the packages, and example
Java programs that make use of these packages.
Last modification to this page occurred on 10/03/2001.
Copyright ©1998, 2001 David Goldschmidt.