Package
Class
Use
Tree
Deprecated
Index
Help
PREV LETTER
NEXT LETTER
FRAMES
NO FRAMES
All Classes
A
C
D
G
H
K
M
N
R
T
V
H
hasEdge(int, int)
- Method in interface kth.csc.inda.
Graph
Returns true if there is an edge from v to w.
hasEdge(int, int)
- Method in class kth.csc.inda.
HashGraph
Returns true if there is an edge from v to w.
hasEdge(int, int)
- Method in class kth.csc.inda.
MatrixGraph
Returns true if there is an edge from v to w.
HashGraph
- Class in
kth.csc.inda
A graph with a fixed number of vertices implemented using adjacency maps.
HashGraph(int)
- Constructor for class kth.csc.inda.
HashGraph
Constructs a HashGraph with n vertices and no edges.
hasNext()
- Method in interface kth.csc.inda.
VertexIterator
Returns true if the iteration has more elements.
Package
Class
Use
Tree
Deprecated
Index
Help
PREV LETTER
NEXT LETTER
FRAMES
NO FRAMES
All Classes
A
C
D
G
H
K
M
N
R
T
V