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

Document Type



This paper continues the discussion of the implementation of graphs using Java 5.0 begun in [1] with special emphasis on weighted graphs, both directed and undirected, as well as the treatment of minimal spanning trees and shortest paths. Again the emphasis will be on implementing a number of the key results in this regard using the predefined List interface and the LinkedList implementation class from the Java Colllections hierarchy.