|
|||||||||
| 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.
Graph.GraphListener s and by
VertexSetListener s.WeightedGraph.ClosestFirstIterator.edge
ModifiableInteger.intValue().
vertex
Graphs instead.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.
EdgeSetFactory 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.
Object.toString() on them.ConnectivityInspector class with
the capability to compute the strongly connected components of a directed
graph.List of Sets, where each set contains vertices
which together form a strongly connected component within the given
graph.
DirectedSubgraphs of the given graph.
Integer object representing this
ModifiableInteger's value.
String object representing this
ModifiableInteger's value.
TraversalListener interface
used for subclasses.ModifiableInteger.
|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||