Graphs/Java/ADT: Difference between revisions
From charlesreid1
No edit summary |
No edit summary |
||
| 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. | |||
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.
 |
Computer Science notes on computer science topics on the wiki, for educational and learning purposes
Part of the 2017 CS Study Plan.
Python/Exceptions · Python/Assertions · Python/Decorators Python/Os (os module) · Python/Strings Python/Splat · Python/Iterators · Python/Generators Python/Comparators · Python/Lambdas
Builtin features of Java: Java/Exceptions · Java/Assertions · Java/Memory · Java/Interfaces Java/Generics · Java/Decorators · Java/Diamond Notation Java/Iterators · Java/Iterable · Iterators vs Iterable Java/Comparators · Java/Comparable · Comparators vs Comparable Java/Numeric · Java/TypeChecking · Java/Testing · Java/Timing · Java/Profiling Documentation: Javadocs · Java/Documentation Tools and functionality: Java/URLs · Java/CSV External libraries: Guava · Fastutil · Eclipse Collections OOP: OOP Checklist · Java/Abstract Class · Java/Encapsulation · Java/Generics
|
See also: