From charlesreid1

Implementing a basic graph abstract data type in Java.

Notes for class design:

  • Should be using arbitrary data types V and E for vertex and edge data
  • No obvious reason to implement comparable for graph/vertex/edge classes, unless we want to compare two vertices' data
  • Graph interface? Need to decide what's common to everyone.

See also: