From charlesreid1

(Created page with "Implementing a basic graph abstract data type in Java.")
 
No edit summary
 
(2 intermediate revisions by the same user not shown)
Line 1: Line 1:
Implementing a basic graph abstract data type in Java.
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.
{{GraphsFlag}}
{{CSFlag}}
[[Category:Java]]

Latest revision as of 22:03, 20 August 2017

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: