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
N
neighbors(int)
- Method in interface kth.csc.inda.
Graph
Returns an iterator of vertices adjacent to v.
neighbors(int)
- Method in class kth.csc.inda.
HashGraph
Returns an iterator of vertices adjacent to v.
neighbors(int)
- Method in class kth.csc.inda.
MatrixGraph
Returns an iterator of vertices adjacent to v.
next()
- Method in interface kth.csc.inda.
VertexIterator
Returns the next element in the iteration.
NO_COST
- Static variable in interface kth.csc.inda.
Graph
An edge with no cost has this value.
numEdges()
- Method in interface kth.csc.inda.
Graph
Returns the number of edges in this graph.
numEdges()
- Method in class kth.csc.inda.
HashGraph
Returns the number of edges in this graph.
numEdges()
- Method in class kth.csc.inda.
MatrixGraph
Returns the number of edges in this graph.
numVertices()
- Method in interface kth.csc.inda.
Graph
Returns the number of vertices in this graph.
numVertices()
- Method in class kth.csc.inda.
HashGraph
Returns the number of vertices in this graph.
numVertices()
- Method in class kth.csc.inda.
MatrixGraph
Returns the number of vertices in this graph.
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