- Factory<T> - Interface in edu.uci.ics.jung.graph.collections
-
- FATARROW - Static variable in interface org.girod.jgraphml.model.ShapeType
-
An arrow.
- FATARROW2 - Static variable in interface org.girod.jgraphml.model.ShapeType
-
An arrow.
- FILL - Static variable in interface org.girod.jgraphml.xml.XMLTags
-
The Fill tag.
- findEdge(V, V) - Method in class edu.uci.ics.jung.graph.AbstractGraph
-
- findEdge(V, V) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph
-
- findEdge(V, V) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph
-
- findEdge(V, V) - Method in class edu.uci.ics.jung.graph.GraphDecorator
-
- findEdge(V, V) - Method in interface edu.uci.ics.jung.graph.Hypergraph
-
Returns an edge that connects this vertex to v.
- findEdge(V, V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree
-
- findEdge(V, V) - Method in class edu.uci.ics.jung.graph.SetHypergraph
-
- findEdge(V, V) - Method in class edu.uci.ics.jung.graph.SparseGraph
-
- findEdge(V, V) - Method in class edu.uci.ics.jung.graph.SparseMultigraph
-
- findEdge(V, V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph
-
- findEdge(V, V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph
-
- findEdgeSet(V, V) - Method in class edu.uci.ics.jung.graph.AbstractGraph
-
- findEdgeSet(V, V) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph
-
- findEdgeSet(V, V) - Method in class edu.uci.ics.jung.graph.GraphDecorator
-
- findEdgeSet(V, V) - Method in interface edu.uci.ics.jung.graph.Hypergraph
-
Returns all edges that connects this vertex to v.
- findEdgeSet(V, V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree
-
- findEdgeSet(V, V) - Method in class edu.uci.ics.jung.graph.SetHypergraph
-
- findEdgeSet(V, V) - Method in class edu.uci.ics.jung.graph.SparseGraph
-
- findEdgeSet(V, V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph
-
- fireGraphEvent(GraphEvent<V, E>) - Method in class edu.uci.ics.jung.graph.ObservableGraph
-
- firstChild() - Method in class org.girod.jgraphml.reader.XMLTreeWalker
-
Moves the TreeWalker to the first visible child of the current node, and returns the new node.
- force_multiplier - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout
-
- Forest<V,E> - Interface in edu.uci.ics.jung.graph
-
An interface for a graph which consists of a collection of rooted
directed acyclic graphs.
- FRLayout<V,E> - Class in edu.uci.ics.jung.algorithms.layout
-
Implements the Fruchterman-Reingold force-directed algorithm for node layout.
- FRLayout() - Constructor for class edu.uci.ics.jung.algorithms.layout.FRLayout
-
Creates an instance which does not initialize the vertex locations.
- FRLayout(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.FRLayout
-
Creates an instance for the specified graph.
- FRLayout(Graph<V, E>, Dimension) - Constructor for class edu.uci.ics.jung.algorithms.layout.FRLayout
-
Creates an instance of size d for the specified graph.
- FRLayout.FRVertexData - Class in edu.uci.ics.jung.algorithms.layout
-
- FRLayout2<V,E> - Class in edu.uci.ics.jung.algorithms.layout
-
Implements the Fruchterman-Reingold force-directed algorithm for node layout.
- FRLayout2() - Constructor for class edu.uci.ics.jung.algorithms.layout.FRLayout2
-
Creates an instance which does not initialize the vertex locations.
- FRLayout2(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.FRLayout2
-
Creates an instance for the specified graph.
- FRLayout2(Graph<V, E>, Dimension) - Constructor for class edu.uci.ics.jung.algorithms.layout.FRLayout2
-
Creates an instance of size d for the specified graph.
- FRVertexData() - Constructor for class edu.uci.ics.jung.algorithms.layout.FRLayout.FRVertexData
-