|
||||||||||
PREV LETTER NEXT LETTER | FRAMES NO FRAMES |
x
belongs.
Integer.MAX_VALUE
.
hasCycle
method can be used to determine if the graph has
a directed cycle.
place
for element x.
place
.
source
to dest
, or null if there is no such edge.
source
to dest
,
or null if there is no such edge.
target
.
target
according to the comparator
associated with this collection.
target
.
x
to the root.
iterator
method should be used to iterate through the collection.
GraphException
is thrown when a graph algorithm is called on
the incorrect type of graph.GraphRepresentation
interface
defines the methods that must be
supported by any graph representation,
such as the adjacency list and adjacency matrix representations.
|
||||||||||
PREV LETTER NEXT LETTER | FRAMES NO FRAMES |