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

I

IN - Static variable in class edu.uci.ics.jung.graph.filters.impl.KNeighborhoodFilter

IN_OUT - Static variable in class edu.uci.ics.jung.graph.filters.impl.KNeighborhoodFilter

IN_TREE_KEY - Static variable in class edu.uci.ics.jung.graph.impl.SparseTree

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

Implements a self-organizing map layout algorithm, based on Meyer's self-organizing graph methods.

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

ISOMLayout.ISOMVertexData - class edu.uci.ics.jung.visualization.ISOMLayout.ISOMVertexData.

ISOMLayout.ISOMVertexData() - Constructor for class edu.uci.ics.jung.visualization.ISOMLayout.ISOMVertexData

Indexer - class edu.uci.ics.jung.graph.decorators.Indexer.

An Indexer applies an index to a Graph.

IsolatedVertexPredicate - class edu.uci.ics.jung.graph.predicates.IsolatedVertexPredicate.

A predicate which tests to see whether a specified vertex has any neighbors.

IterativeProcess - class edu.uci.ics.jung.algorithms.IterativeProcess.

Provides basic infrastructure for iterative algorithms.

IterativeProcess() - Constructor for class edu.uci.ics.jung.algorithms.IterativeProcess

Generic constructor.

importUserData(UserDataContainer) - Method in class edu.uci.ics.jung.graph.impl.AbstractHyperUnitBPG

importUserData(UserDataContainer) - Method in class edu.uci.ics.jung.graph.impl.HypergraphBPG

importUserData(UserDataContainer) - Method in class edu.uci.ics.jung.utils.UserData

Uses the CopyAction to determine how each of the user datum elements in udc should be carried over to the this UserDataContiner

importUserData(UserDataContainer) - Method in interface edu.uci.ics.jung.utils.UserDataContainer

Takes the user data stored in udc and copies it to this object's user data repository, respecting each datum's CopyAction.

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

Returns the number of incoming edges that are incident to this vertex.

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

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

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

incStart() - Method in class org.civi.util.GlobalFlags

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

Adds one to the contained integer value.

incrementDisp(double, double) - Method in class edu.uci.ics.jung.visualization.FRLayout.FRVertexData

incrementDisp(double, double) - Method in class edu.uci.ics.jung.visualization.ISOMLayout.ISOMVertexData

incrementsAreDone() - Method in class edu.uci.ics.jung.visualization.FRLayout

Returns true once the current iteration has passed the maximum count, MAX_ITERATIONS.

incrementsAreDone() - Method in class edu.uci.ics.jung.visualization.FadingVertexLayout

Passthrough.

incrementsAreDone() - Method in class edu.uci.ics.jung.visualization.ISOMLayout

For now, we pretend it never finishes.

incrementsAreDone() - Method in interface edu.uci.ics.jung.visualization.Layout

If this visualization is incremental, tells whether it has stabilized at a satisfactory spot yet.

incrementsAreDone() - Method in class edu.uci.ics.jung.visualization.SpringLayout

incrementsAreDone() - Method in class edu.uci.ics.jung.visualization.contrib.CircleLayout

Returns true;

incrementsAreDone() - Method in class edu.uci.ics.jung.visualization.contrib.DAGLayout

Override incrementsAreDone so that we can eventually stop.

incrementsAreDone() - Method in class edu.uci.ics.jung.visualization.contrib.KKLayout

Returns true once the current iteration has passed the maximum count.

incrementsAreDone() - Method in class edu.uci.ics.jung.visualization.contrib.KKLayoutInt

Returns true once the current iteration has passed the maximum count.

init() - Method in class CiviApplet

init() - Method in class edu.uci.ics.jung.visualization.VisualizationViewer

Pre-relaxes and starts a visRunner thread

initialize() - Method in class edu.uci.ics.jung.graph.impl.BipartiteGraph

initialize(Dimension) - Method in class edu.uci.ics.jung.visualization.AbstractLayout

Initializer, calls intialize_local and initializeLocations to start construction process.

initialize() - Method in class edu.uci.ics.jung.visualization.FRLayout.FRVertexData

initialize(Dimension) - Method in class edu.uci.ics.jung.visualization.FadingVertexLayout

A pass-through to the contained Layout

initialize() - Method in class edu.uci.ics.jung.visualization.ISOMLayout.ISOMVertexData

initialize(Dimension) - Method in interface edu.uci.ics.jung.visualization.Layout

Initializes fields in the node that may not have been set during the constructor.

insert(Object) - Method in class edu.uci.ics.jung.utils.MapBinaryHeap

intValue(UserDataContainer) - Method in class edu.uci.ics.jung.graph.decorators.NumericDecorator

Retrieves the decorated value for the given graph/vertex/edge as an integer

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

Returns the floor integer value, accomplished by casting the contained double to int.

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

Returns the integer value of this object.

isAcceptThoseAboveThreshhold() - Method in class edu.uci.ics.jung.graph.filters.impl.AlphabeticVertexFilter

Returns the current direction of the comparison: True if this accepts only strings above the threshhold, otherwise, accepts only strings at or below the threshhold.

isConnected(Graph) - Static method in class edu.uci.ics.jung.utils.GraphProperties

Checks to see whether the graph is connected

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

Returns true if this vertex is a destination of the specified edge e, and false otherwise.

isDest(Edge) - Method in class edu.uci.ics.jung.graph.impl.SimpleDirectedSparseVertex

isDest(Edge) - Method in class edu.uci.ics.jung.graph.impl.SimpleSparseVertex

isDest(Edge) - Method in class edu.uci.ics.jung.graph.impl.SimpleUndirectedSparseVertex

isDirected() - Method in interface edu.uci.ics.jung.graph.Graph

Deprecated. As of version 1.4, replaced by edu.uci.ics.jung.graph.utils.PredicateUtils#enforcesDirected(Graph) and edu.uci.ics.jung.graph.utils.PredicateUtils#enforcesUndirected(Graph).

isDirected() - Method in class edu.uci.ics.jung.graph.impl.AbstractSparseGraph

Deprecated. As of version 1.4, the semantics of this method have changed; it no longer returns a boolean value that is hardwired into the class definition, but checks to see whether one of the requirements of this graph is that it only accepts directed edges.

isEmpty() - Method in class edu.uci.ics.jung.utils.MapBinaryHeap

isHidden - Variable in class edu.uci.ics.jung.visualization.FadingVertexLayout.FadingVertexLayoutData

isHidden(Vertex) - Method in class edu.uci.ics.jung.visualization.FadingVertexLayout

Static utility function returns the fade level of a given vertex.

isIncident(ArchetypeVertex) - Method in interface edu.uci.ics.jung.graph.ArchetypeEdge

Returns true if the specified vertex v is incident to this edge, and false otherwise.

isIncident(ArchetypeEdge) - Method in interface edu.uci.ics.jung.graph.ArchetypeVertex

Returns true if the specified edge e is incident to this vertex, and false otherwise.

isIncident(ArchetypeVertex) - Method in class edu.uci.ics.jung.graph.impl.AbstractSparseEdge

isIncident(ArchetypeEdge) - Method in class edu.uci.ics.jung.graph.impl.AbstractSparseVertex

isIncident(ArchetypeVertex) - Method in class edu.uci.ics.jung.graph.impl.HyperedgeBPG

isIncident(ArchetypeEdge) - Method in class edu.uci.ics.jung.graph.impl.HypervertexBPG

isIncremental() - Method in class edu.uci.ics.jung.visualization.FRLayout

This one is an incremental visualization.

isIncremental() - Method in class edu.uci.ics.jung.visualization.FadingVertexLayout

Passthrough.

isIncremental() - Method in class edu.uci.ics.jung.visualization.ISOMLayout

This one is an incremental visualization.

isIncremental() - Method in interface edu.uci.ics.jung.visualization.Layout

Indicates whether this visualization has an incremental mode.

isIncremental() - Method in class edu.uci.ics.jung.visualization.SpringLayout

isIncremental() - Method in class edu.uci.ics.jung.visualization.contrib.CircleLayout

This one is not incremental.

isIncremental() - Method in class edu.uci.ics.jung.visualization.contrib.KKLayout

This one is an incremental visualization.

isIncremental() - Method in class edu.uci.ics.jung.visualization.contrib.KKLayoutInt

This one is an incremental visualization.

isInitializationPredicate - Variable in class edu.uci.ics.jung.graph.predicates.GPredicate

isNeighborOf(ArchetypeVertex) - Method in interface edu.uci.ics.jung.graph.ArchetypeVertex

Returns true if the specified vertex v and this vertex are each incident to one or more of the same edges, and false otherwise.

isNeighborOf(ArchetypeVertex) - Method in class edu.uci.ics.jung.graph.impl.AbstractSparseVertex

isNeighborOf(ArchetypeVertex) - Method in class edu.uci.ics.jung.graph.impl.HypervertexBPG

Not a very efficient implementation

isPicked(Vertex) - Method in interface edu.uci.ics.jung.visualization.PickedInfo

isPicked(Vertex) - Method in class edu.uci.ics.jung.visualization.VisualizationViewer

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

Returns true if this vertex is a predecessor of the specified vertex v, and false otherwise.

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

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

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

isRankingNodes() - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker

Indicates whether this ranker is ranking nodes or edges.

isShowAll() - Method in class org.civi.util.GlobalFlags

isShowOnlySelected() - Method in class org.civi.util.GlobalFlags

isSimple(Graph) - Static method in class edu.uci.ics.jung.utils.GraphProperties

Checks to see whether the graphs is simple, i.e. contains parallel edges and self-loops

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

Returns true if this vertex is a source of the specified edge e, and false otherwise.

isSource(Edge) - Method in class edu.uci.ics.jung.graph.impl.SimpleDirectedSparseVertex

isSource(Edge) - Method in class edu.uci.ics.jung.graph.impl.SimpleSparseVertex

isSource(Edge) - Method in class edu.uci.ics.jung.graph.impl.SimpleUndirectedSparseVertex

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

Returns true if this vertex is a successor of the specified vertex v, and false otherwise.

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

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

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

isVisRunnerRunning() - Method in class edu.uci.ics.jung.visualization.VisualizationViewer

Returns a flag that says whether the visRunner thread is running.

iterator() - Method in class edu.uci.ics.jung.algorithms.cluster.ClusterSet

Returns an iterator to the component list.