This paper was originally published as a Technical Report No. 224, March 2006 for the Ivan E. Seidenberg School of Computer Science and Information Systems (ISSCSIS) Pace University.

Document Type



This paper presents an implementation in Java of two abstract data types for graphs: directed and undirected graphs. We view the concrete class of directed graphs as the parent class with undirected graphs as an immediate subclass. Each is designed using facilities available from Java 5.0. This paper describes the use of adjacency lists using the predefined List interface and the LinkedList implementation class from java.util.