|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Graph
interface.Graph.addEdge(Object, Object)
method.
Graph.addEdge(Object, Object)
method.
Graph.addEdge(Object, Object)
method.
v1
and v2
, taking into
account whether ascending or descending order is used.
ModifiableInteger
objects numerically.
ModifiableInteger
object to another object.
Set
s, where each set contains all
vertices that are in the same maximally connected component.
GraphListener
s and by
VertexSetListener
s.ClosestFirstIterator
.EdgeFactory
classes.null
if element has no
label.
ModifiableInteger.intValue()
.
ModifiableInteger
.
true
if and only if self-loops are allowed in this
graph.
true
if and only if multiple edges are allowed in
this graph.
reuseEvents
flag is set.
reuseEvents
flag is set.
StronglyConnectivityInspector
instance is strongly
connected.
ListenableGraph
.ListenableGraph
.ListenableGraph
.ListenableGraph
.ModifiableInteger
class wraps a value of the primitive type
int
in an object, similarly to Integer
.ModifiableInteger
object that
represents the specified int
value.
Graph
,
DirectedGraph
and UndirectedGraph
.next
method.
ConnectivityInspector
class
with the capability to compute the strongly connected components of a
directed graph.EdgeListFactory
to use for this graph.
reuseEvents
flag is set to true
this
class will reuse previously fired events and will not create a new
object for each event.
reuseEvents
flag.
List
of Set
s, where each set contains
vertices which together form a strongly connected component within the
given graph.
DirectedSubgraph
s of the given graph.
TraversalListener
interface used for subclasses.Integer
object representing this
ModifiableInteger
's value.
String
object representing this
ModifiableInteger
's value.
ModifiableInteger
.
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |