- UNDEFINED - Static variable in class org.girod.jgraphml.model.PortConstraints
-
- undirected_edges - Variable in class edu.uci.ics.jung.graph.SparseGraph
-
- UndirectedGraph<V,E> - Interface in edu.uci.ics.jung.graph
-
A tagging interface for extensions of Graph that
accept only undirected edges.
- UndirectedOrderedSparseMultigraph<V,E> - Class in edu.uci.ics.jung.graph
-
An implementation of UndirectedGraph that is suitable for sparse graphs,
orders its vertex and edge collections according to insertion time, and permits
parallel edges.
- UndirectedOrderedSparseMultigraph() - Constructor for class edu.uci.ics.jung.graph.UndirectedOrderedSparseMultigraph
-
Creates a new instance.
- UndirectedSparseGraph<V,E> - Class in edu.uci.ics.jung.graph
-
An implementation of UndirectedGraph that is suitable
for sparse graphs.
- UndirectedSparseGraph() - Constructor for class edu.uci.ics.jung.graph.UndirectedSparseGraph
-
Creates an instance.
- UndirectedSparseMultigraph<V,E> - Class in edu.uci.ics.jung.graph
-
An implementation of UndirectedGraph that is suitable for
sparse graphs and permits parallel edges.
- UndirectedSparseMultigraph() - Constructor for class edu.uci.ics.jung.graph.UndirectedSparseMultigraph
-
Creates a new instance.
- unknownVertices - Variable in class edu.uci.ics.jung.algorithms.path.DijkstraDistance.SourceData
-
- unmodifiableDirectedGraph(DirectedGraph<V, E>) - Static method in class edu.uci.ics.jung.graph.util.Graphs
-
Returns an unmodifiable DirectedGraph backed by the passed graph.
- unmodifiableForest(Forest<V, E>) - Static method in class edu.uci.ics.jung.graph.util.Graphs
-
Returns an unmodifiable Forest backed by the passed forest.
- unmodifiableGraph(Graph<V, E>) - Static method in class edu.uci.ics.jung.graph.util.Graphs
-
Returns an unmodifiable Graph backed by the passed Graph.
- unmodifiableTree(Tree<V, E>) - Static method in class edu.uci.ics.jung.graph.util.Graphs
-
Returns an unmodifiable Tree backed by the passed tree.
- unmodifiableUndirectedGraph(UndirectedGraph<V, E>) - Static method in class edu.uci.ics.jung.graph.util.Graphs
-
Returns an unmodifiable UndirectedGraph backed by the passed graph.
- UnweightedShortestPath<V,E> - Class in edu.uci.ics.jung.algorithms.path
-
Computes the shortest path distances for graphs whose edges are not weighted (using BFS).
- UnweightedShortestPath(Hypergraph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.path.UnweightedShortestPath
-
Constructs and initializes algorithm
- update(V, E, double) - Method in class edu.uci.ics.jung.algorithms.path.DijkstraDistance.SourceData
-
- update(T) - Method in class edu.uci.ics.jung.algorithms.util.MapBinaryHeap
-
Informs the heap that this object's internal key value has been
updated, and that its place in the heap may need to be shifted
(up or down).
- updateLabel() - Method in class org.girod.jgraphml.model.GraphMLEdge
-
Called when the label is updated.
- updateLabel() - Method in class org.girod.jgraphml.model.GraphMLGroupNode
-
Called when the label is updated.
- updateLabel() - Method in class org.girod.jgraphml.model.GraphMLNode
-
Called when the label is updated.
- updateLabel() - Method in interface org.girod.jgraphml.model.IGraphMLNode
-
Called when the label is updated.
- updateLabel() - Method in interface org.girod.jgraphml.model.LabeledElement
-
Called when the label is updated.
- Utilities - Class in org.girod.jgraphml.model
-
Various utilities for the model.