- DAGLayout<V,E> - Class in edu.uci.ics.jung.algorithms.layout
-
An implementation of Layout suitable for tree-like directed
acyclic graphs.
- DAGLayout() - Constructor for class edu.uci.ics.jung.algorithms.layout.DAGLayout
-
Creates an instance which does not initialize the vertex locations.
- DAGLayout(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.DAGLayout
-
Creates an instance for the specified graph.
- DASHED - Static variable in class org.girod.jgraphml.model.LineStyle
-
The dashed style.
- DATA - Static variable in interface org.girod.jgraphml.xml.XMLTags
-
The data tag.
- decodeColor(Color) - Static method in class org.girod.jgraphml.model.Utilities
-
Decode a color.
- decodeColor(String) - Static method in class org.girod.jgraphml.model.Utilities
-
Decode a color.
- DEFAULT_DISTX - Static variable in class edu.uci.ics.jung.algorithms.layout.TreeLayout
-
The default horizontal vertex spacing.
- DEFAULT_DISTY - Static variable in class edu.uci.ics.jung.algorithms.layout.TreeLayout
-
The default vertical vertex spacing.
- DEFAULT_RATIO - Static variable in class org.girod.jgraphml.model.EdgeLabel.ParamModel
-
0.5f: The default ratio.
- DEFAULTCONTENT1 - Static variable in class org.girod.jgraphml.app.ScriptWrapper
-
- defaultEdgeType - Variable in class org.girod.jgraphml.model.AbstractGraphMLDiagram
-
The diagram edges type.
- DefaultParallelEdgeIndexFunction<V,E> - Class in edu.uci.ics.jung.graph.util
-
A class which creates and maintains indices for parallel edges.
- defaults - Variable in class org.girod.jgraphml.model.AbstractGraphMLDiagram
-
The diagram defaults.
- degree(V) - Method in class edu.uci.ics.jung.graph.AbstractGraph
-
- degree(V) - Method in class edu.uci.ics.jung.graph.GraphDecorator
-
- degree(V) - Method in interface edu.uci.ics.jung.graph.Hypergraph
-
Returns the number of edges incident to vertex.
- degree(V) - Method in class edu.uci.ics.jung.graph.SetHypergraph
-
- delegate - Variable in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
-
- delegate - Variable in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
-
- delegate - Variable in class edu.uci.ics.jung.graph.GraphDecorator
-
- DelegateForest<V,E> - Class in edu.uci.ics.jung.graph
-
An implementation of Forest that delegates to a specified DirectedGraph
instance.
- DelegateForest() - Constructor for class edu.uci.ics.jung.graph.DelegateForest
-
Creates an instance backed by a new DirectedSparseGraph instance.
- DelegateForest(DirectedGraph<V, E>) - Constructor for class edu.uci.ics.jung.graph.DelegateForest
-
Creates an instance backed by the input DirectedGraph i
- DelegateTree<V,E> - Class in edu.uci.ics.jung.graph
-
An implementation of Tree that delegates to
a specified instance of DirectedGraph.
- DelegateTree() - Constructor for class edu.uci.ics.jung.graph.DelegateTree
-
Creates an instance.
- DelegateTree(Factory<DirectedGraph<V, E>>) - Constructor for class edu.uci.ics.jung.graph.DelegateTree
-
create an instance with passed values.
- DelegateTree(DirectedGraph<V, E>) - Constructor for class edu.uci.ics.jung.graph.DelegateTree
-
Creates a new DelegateTree which delegates to graph.
- DELTA - Static variable in interface org.girod.jgraphml.model.ArrowType
-
The constant for having a black delta arrow.
- detachNode(AbstractGraphMLNode) - Method in class org.girod.jgraphml.model.AbstractGraphMLDiagram
-
Detach a node from the diagram.
- diagram - Variable in class org.girod.jgraphml.model.AbstractGraphMLNode
-
The diagram.
- DiagramDefaults - Class in org.girod.jgraphml.model
-
The default properties for elements in a diagram.
- DiagramDefaults() - Constructor for class org.girod.jgraphml.model.DiagramDefaults
-
- DiagramKey - Class in org.girod.jgraphml.model
-
Represents a diagram key.
- DiagramKey(KeyType, String) - Constructor for class org.girod.jgraphml.model.DiagramKey
-
Constructor.
- DiagramResource - Interface in org.girod.jgraphml.model
-
A diagram resource.
- diameter - Variable in class edu.uci.ics.jung.algorithms.layout.KKLayout
-
The diameter of the visible graph.
- diameter(Hypergraph<V, E>, Distance<V>, boolean) - Static method in class edu.uci.ics.jung.algorithms.path.DistanceStatistics
-
Returns the diameter of g using the metric
specified by d.
- diameter(Hypergraph<V, E>, Distance<V>) - Static method in class edu.uci.ics.jung.algorithms.path.DistanceStatistics
-
Returns the diameter of g using the metric
specified by d.
- diameter(Hypergraph<V, E>) - Static method in class edu.uci.ics.jung.algorithms.path.DistanceStatistics
-
Returns the diameter of g, ignoring edge weights.
- DIAMOND - Static variable in interface org.girod.jgraphml.model.ArrowType
-
The constant for having a black filled diamond arrow.
- DIAMOND - Static variable in interface org.girod.jgraphml.model.ShapeType
-
A diamond.
- DijkstraDistance<V,E> - Class in edu.uci.ics.jung.algorithms.path
-
Calculates distances in a specified graph, using
Dijkstra's single-source-shortest-path algorithm.
- DijkstraDistance(Hypergraph<V, E>, Transformer<E, ? extends Number>, boolean) - Constructor for class edu.uci.ics.jung.algorithms.path.DijkstraDistance
-
Creates an instance of DijkstraShortestPath for
the specified graph and the specified method of extracting weights
from edges, which caches results locally if and only if
cached is true.
- DijkstraDistance(Hypergraph<V, E>, Transformer<E, ? extends Number>) - Constructor for class edu.uci.ics.jung.algorithms.path.DijkstraDistance
-
Creates an instance of DijkstraShortestPath for
the specified graph and the specified method of extracting weights
from edges, which caches results locally.
- DijkstraDistance(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.path.DijkstraDistance
-
Creates an instance of DijkstraShortestPath for
the specified unweighted graph (that is, all weights 1) which
caches results locally.
- DijkstraDistance(Graph<V, E>, boolean) - Constructor for class edu.uci.ics.jung.algorithms.path.DijkstraDistance
-
Creates an instance of DijkstraShortestPath for
the specified unweighted graph (that is, all weights 1) which
caches results locally.
- DijkstraDistance.SourceData - Class in edu.uci.ics.jung.algorithms.path
-
For a given source vertex, holds the estimated and final distances,
tentative and final assignments of incoming edges on the shortest path from
the source vertex, and a priority queue (ordered by estimated distance)
of the vertices for which distances are unknown.
- DijkstraDistance.VertexComparator<V> - Class in edu.uci.ics.jung.algorithms.path
-
Compares according to distances, so that the BinaryHeap knows how to
order the tree.
- directed_edges - Variable in class edu.uci.ics.jung.graph.SparseGraph
-
- directedEdges - Variable in class edu.uci.ics.jung.graph.SparseMultigraph
-
- DirectedGraph<V,E> - Interface in edu.uci.ics.jung.graph
-
A tagging interface for implementations of Graph
that accept only directed edges.
- DirectedOrderedSparseMultigraph<V,E> - Class in edu.uci.ics.jung.graph
-
An implementation of DirectedGraph, suitable for sparse graphs,
that orders its vertex and edge collections
according to insertion time.
- DirectedOrderedSparseMultigraph() - Constructor for class edu.uci.ics.jung.graph.DirectedOrderedSparseMultigraph
-
Creates a new instance.
- DirectedSparseGraph<V,E> - Class in edu.uci.ics.jung.graph
-
An implementation of DirectedGraph suitable for sparse graphs.
- DirectedSparseGraph() - Constructor for class edu.uci.ics.jung.graph.DirectedSparseGraph
-
Creates an instance.
- DirectedSparseMultigraph<V,E> - Class in edu.uci.ics.jung.graph
-
An implementation of DirectedGraph, suitable for sparse graphs,
that permits parallel edges.
- DirectedSparseMultigraph() - Constructor for class edu.uci.ics.jung.graph.DirectedSparseMultigraph
-
Creates a new instance.
- dist_reached - Variable in class edu.uci.ics.jung.algorithms.path.DijkstraDistance.SourceData
-
- distance - Variable in class edu.uci.ics.jung.algorithms.layout.KKLayout
-
Retrieves graph distances between vertices of the visible graph
- Distance<V> - Interface in edu.uci.ics.jung.algorithms.path
-
An interface for classes which calculate the distance between
one vertex and another.
- distance - Variable in class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer
-
The metric to use for specifying the distance between pairs of vertices.
- DistanceCentralityScorer<V,E> - Class in edu.uci.ics.jung.algorithms.scoring
-
Assigns scores to vertices based on their distances to each other vertex
in the graph.
- DistanceCentralityScorer(Hypergraph<V, E>, Distance<V>, boolean, boolean, boolean) - Constructor for class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer
-
Creates an instance with the specified graph, distance metric, and
averaging behavior.
- DistanceCentralityScorer(Hypergraph<V, E>, Distance<V>, boolean) - Constructor for class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer
-
Equivalent to this(graph, distance, averaging, true, true).
- DistanceCentralityScorer(Hypergraph<V, E>, Transformer<E, ? extends Number>, boolean, boolean, boolean) - Constructor for class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer
-
Creates an instance with the specified graph and averaging behavior
whose vertex distances are calculated based on the specified edge
weights.
- DistanceCentralityScorer(Hypergraph<V, E>, Transformer<E, ? extends Number>, boolean) - Constructor for class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer
-
Equivalent to this(graph, edge_weights, averaging, true, true).
- DistanceCentralityScorer(Hypergraph<V, E>, boolean, boolean, boolean) - Constructor for class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer
-
Creates an instance with the specified graph and averaging behavior
whose vertex distances are calculated on the unweighted graph.
- DistanceCentralityScorer(Hypergraph<V, E>, boolean) - Constructor for class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer
-
Equivalent to this(graph, averaging, true, true).
- distances - Variable in class edu.uci.ics.jung.algorithms.path.DijkstraDistance.SourceData
-
- DistanceStatistics - Class in edu.uci.ics.jung.algorithms.path
-
Statistics relating to vertex-vertex distances in a graph.
- DistanceStatistics() - Constructor for class edu.uci.ics.jung.algorithms.path.DistanceStatistics
-
- distX - Variable in class edu.uci.ics.jung.algorithms.layout.TreeLayout
-
The horizontal vertex spacing.
- distY - Variable in class edu.uci.ics.jung.algorithms.layout.TreeLayout
-
The vertical vertex spacing.
- done() - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
-
Check all sublayouts.keySet() and the delegate layout, returning
done == true iff all are done.
- done() - Method in class edu.uci.ics.jung.algorithms.layout.DAGLayout
-
Override incrementsAreDone so that we can eventually stop.
- done() - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout
-
Returns true once the current iteration has passed the maximum count,
MAX_ITERATIONS.
- done() - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout2
-
Returns true once the current iteration has passed the maximum count,
MAX_ITERATIONS.
- done() - Method in class edu.uci.ics.jung.algorithms.layout.ISOMLayout
-
Returns true if the vertex positions are no longer being
updated.
- done() - Method in class edu.uci.ics.jung.algorithms.layout.KKLayout
-
Returns true once the current iteration has passed the maximum count.
- done() - Method in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
-
- done() - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout
-
For now, we pretend it never finishes.
- done - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout2
-
- done() - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout2
-
- done() - Method in interface edu.uci.ics.jung.algorithms.util.IterativeContext
-
Returns true if this iterative process is finished, and false otherwise.
- DROP_SHADOW - Static variable in interface org.girod.jgraphml.xml.XMLTags
-
The y:DropShadow tag.
- DropShadow - Class in org.girod.jgraphml.model
-
A node drop shadow.
- DropShadow() - Constructor for class org.girod.jgraphml.model.DropShadow
-
- DropShadow(float, float) - Constructor for class org.girod.jgraphml.model.DropShadow
-
Constructor.
- DropShadow(String, float, float) - Constructor for class org.girod.jgraphml.model.DropShadow
-
Constructor.
- dx - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout.SpringVertexData
-
movement speed, x
- dy - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout.SpringVertexData
-
movement speed, y