A B C D E F G H I K L M N O P R S T U V W X Y

F

FILTER_GRAPH_KEY - Static variable in class edu.uci.ics.jung.graph.filters.GraphAssemblyRecord

The key that identifes this GraphAssemblyRecord in the UserData.

FOLDED_DATA - Static variable in class edu.uci.ics.jung.algorithms.transformation.KPartiteFolder

Used in fold() as a user data key to the data attached to the edges in the folded graph.

FRLayout - class edu.uci.ics.jung.visualization.FRLayout.

Implements the Fruchterman-Reingold algorithm for node layout.

FRLayout(Graph) - Constructor for class edu.uci.ics.jung.visualization.FRLayout

FRLayout.FRVertexData - class edu.uci.ics.jung.visualization.FRLayout.FRVertexData.

FRLayout.FRVertexData() - Constructor for class edu.uci.ics.jung.visualization.FRLayout.FRVertexData

FadingVertexLayout - class edu.uci.ics.jung.visualization.FadingVertexLayout.

Implements a pass-through visaulizer that fades out nodes that have been removed, and fades in nodes that have appeared.

FadingVertexLayout(int, Layout) - Constructor for class edu.uci.ics.jung.visualization.FadingVertexLayout

Adds user data to every vertex in the graph.

FadingVertexLayout.FadingVertexLayoutData - class edu.uci.ics.jung.visualization.FadingVertexLayout.FadingVertexLayoutData.

FadingVertexLayout.FadingVertexLayoutData() - Constructor for class edu.uci.ics.jung.visualization.FadingVertexLayout.FadingVertexLayoutData

FatalException - exception edu.uci.ics.jung.exceptions.FatalException.

FatalException(String) - Constructor for class edu.uci.ics.jung.exceptions.FatalException

FatalException(String, Throwable) - Constructor for class edu.uci.ics.jung.exceptions.FatalException

Filter - interface edu.uci.ics.jung.graph.filters.Filter.

A Filter returns a subgraph of a Graph, in the form of an UnsassembledGraph.

fill(DoubleArrayList) - Method in class edu.uci.ics.jung.statistics.Histogram

Fills the histogram with the list of random values

fill(double) - Method in class edu.uci.ics.jung.statistics.Histogram

Fills with a random variable.

filter(UnassembledGraph) - Method in interface edu.uci.ics.jung.graph.filters.EfficientFilter

Filters a graph by returning an UnassembledGraph consisting of nodes and edges that pass the filter.

filter(Graph) - Method in interface edu.uci.ics.jung.graph.filters.Filter

Filters a graph by returning an UnassembledGraph consisting of nodes and edges that pass the filter.

filter(Graph) - Method in class edu.uci.ics.jung.graph.filters.GeneralEdgeAcceptFilter

Returns an UnassembledGraph with the subset of edges that pass acceptEdge.

filter(UnassembledGraph) - Method in class edu.uci.ics.jung.graph.filters.GeneralEdgeAcceptFilter

Returns an UnassembledGraph with the subset of edges that pass acceptEdge.

filter(Graph) - Method in class edu.uci.ics.jung.graph.filters.GeneralVertexAcceptFilter

This method does the actual filtering of the the graph.

filter(UnassembledGraph) - Method in class edu.uci.ics.jung.graph.filters.GeneralVertexAcceptFilter

Returns an UnassembledGraph with the subset of vertices that pass acceptEdge.

filter(Graph) - Method in class edu.uci.ics.jung.graph.filters.SerialFilter

Runs through the sequence of filters, one at a time.

filter(UnassembledGraph) - Method in class edu.uci.ics.jung.graph.filters.SerialFilter

Runs through the sequence of filters, one at a time.

filter(Graph) - Method in class edu.uci.ics.jung.graph.filters.impl.KNeighborhoodFilter

Constructs an unassembled graph containing the k-neighbhood around the root node(s)

findEdge(Vertex) - Method in interface edu.uci.ics.jung.graph.Vertex

Returns a directed outgoing edge from this vertex to v, or an undirected edge that connects this vertex to v.

findEdge(Vertex) - Method in class edu.uci.ics.jung.graph.impl.AbstractSparseVertex

Returns the edge that connects this vertex to the specified vertex v.

findEdge(Vertex) - Method in class edu.uci.ics.jung.graph.impl.DirectedSparseVertex

Returns the edge that connects this vertex to the specified vertex v, or null if there is no such edge.

findEdge(Vertex) - Method in class edu.uci.ics.jung.graph.impl.SimpleDirectedSparseVertex

Returns the edge that connects this vertex to the specified vertex v, or null if there is no such edge.

findEdge(Vertex) - Method in class edu.uci.ics.jung.graph.impl.SimpleSparseVertex

findEdge(Vertex) - Method in class edu.uci.ics.jung.graph.impl.SimpleUndirectedSparseVertex

Returns the edge that connects this vertex to the specified vertex v, or null if there is no such edge.

findEdge(Vertex) - Method in class edu.uci.ics.jung.graph.impl.SparseVertex

Returns the edge that connects this vertex to the specified vertex v, or null if there is no such edge.

findEdge(Vertex) - Method in class edu.uci.ics.jung.graph.impl.UndirectedSparseVertex

Returns the edge that connects this vertex to the specified vertex v, or null if there is no such edge.

findEdgeSet(Vertex) - Method in interface edu.uci.ics.jung.graph.Vertex

Returns the set of all edges that connect this vertex with the specified vertex v.

findEdgeSet(Vertex) - Method in class edu.uci.ics.jung.graph.impl.AbstractSparseVertex

findEdgeSet(Vertex) - Method in class edu.uci.ics.jung.graph.impl.DirectedSparseVertex

findEdgeSet(Vertex) - Method in class edu.uci.ics.jung.graph.impl.SimpleDirectedSparseVertex

Returns the set of edges that connect this vertex to the specified vertex.

findEdgeSet(Vertex) - Method in class edu.uci.ics.jung.graph.impl.SimpleSparseVertex

findEdgeSet(Vertex) - Method in class edu.uci.ics.jung.graph.impl.SparseVertex

findEdgeSet(Vertex) - Method in class edu.uci.ics.jung.graph.impl.UndirectedSparseVertex

floatValue() - Method in class edu.uci.ics.jung.utils.MutableDouble

Returns the nearest float value, accomplished by casting the contained double to float.

floatValue() - Method in class edu.uci.ics.jung.utils.MutableInteger

Returns the integer value of this object, expressed as a float.

fold(KPartiteGraph, Predicate) - Method in class edu.uci.ics.jung.algorithms.transformation.KPartiteFolder

Converts g into a unipartite graph whose vertex set is the vertices whose partition is specified by p.

fold(BipartiteGraph, BipartiteGraph.Choice) - Static method in class edu.uci.ics.jung.graph.impl.BipartiteGraph

Creates a one-part graph from a bipartite graph by folding Vertices from one class into a second class.

forceMove(Vertex, int, int) - Method in class edu.uci.ics.jung.visualization.AbstractLayout

Forcibly moves a vertex to the (x,y) location by setting its x and y locations to the inputted location.

forceMove(Vertex, int, int) - Method in class edu.uci.ics.jung.visualization.FRLayout

forceMove(Vertex, int, int) - Method in class edu.uci.ics.jung.visualization.FadingVertexLayout

Simply passes through the vertex.

forceMove(Vertex, int, int) - Method in interface edu.uci.ics.jung.visualization.Layout

Forces a node to be moved to location x,y

forceMove(Vertex, int, int) - Method in class edu.uci.ics.jung.visualization.contrib.DAGLayout

Override forceMove so that if someone moves a node, we can re-layout everything.