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

C

CENTRALITY - Static variable in class edu.uci.ics.jung.algorithms.importance.BetweennessCentrality

CENTRALITY - Static variable in class edu.uci.ics.jung.algorithms.importance.RandomWalkBetweenness

CENTRALITY - Static variable in class edu.uci.ics.jung.algorithms.importance.RandomWalkSTBetweenness

CLASSA - Static variable in class edu.uci.ics.jung.graph.impl.BipartiteGraph

CLASSB - Static variable in class edu.uci.ics.jung.graph.impl.BipartiteGraph

CLASSIC - Static variable in class edu.uci.ics.jung.visualization.contrib.Arrow

CLONE - Static variable in class edu.uci.ics.jung.utils.UserData

A CopyAction that clones UserData--that is, it uses the Java clone()call to clone the object.

CircleLayout - class edu.uci.ics.jung.visualization.contrib.CircleLayout.

Positions vertices equally spaced on a regular circle.

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

CircleLayout.CircleVertexData - class edu.uci.ics.jung.visualization.contrib.CircleLayout.CircleVertexData.

CircleLayout.CircleVertexData() - Constructor for class edu.uci.ics.jung.visualization.contrib.CircleLayout.CircleVertexData

CiviApplet - class CiviApplet.

The CiviApplet consists of three areas, the visualization view, the detail view, and the control panel.

CiviApplet() - Constructor for class CiviApplet

CiviApplet.ControlPanel - class CiviApplet.ControlPanel.

CiviApplet.ControlPanel(Color) - Constructor for class CiviApplet.ControlPanel

CiviDocument - class org.civi.graph.CiviDocument.

This class represents a document.

CiviDocument(String) - Constructor for class org.civi.graph.CiviDocument

CiviEdge - class org.civi.graph.CiviEdge.

This class represents the linkage between a document and a keyword.

CiviEdge() - Constructor for class org.civi.graph.CiviEdge

CiviKeyword - class org.civi.graph.CiviKeyword.

This class represents a keyword.

CiviKeyword(String) - Constructor for class org.civi.graph.CiviKeyword

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

Returns true if this graph is a clique (that is, if each vertex in the graph is a neighbor of each other vertex; also known as a complete graph).

ClusterSet - class edu.uci.ics.jung.algorithms.cluster.ClusterSet.

A data structure representing the clusters, connected set of vertices (or edges), in a graph.

ClusterSet(Graph) - Constructor for class edu.uci.ics.jung.algorithms.cluster.ClusterSet

Creates a new instance.

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

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

Stores coordinates (X,Y) for vertices being visualized.

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

Coordinates(double, double) - Constructor for class edu.uci.ics.jung.visualization.Coordinates

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

Initializes this coordinate to the value of the passed-in coordinate.

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

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

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

callBack(String) - Method in class edu.uci.ics.jung.visualization.GraphDraw

callBack(String) - Method in interface edu.uci.ics.jung.visualization.StatusCallback

checkEquivalent(Graph) - Method in class edu.uci.ics.jung.algorithms.blockmodel.StructurallyEquivalent

For each vertex pair v, v1 in G, checks whether v and v1 are fully equivalent: meaning that they connect to the exact same vertices.

checkEquivalent(Graph) - Method in class edu.uci.ics.jung.algorithms.blockmodel.StructurallyEquivalentII

For each vertex pair v, v1 in G, checks whether v and v1 are fully equivalent: meaning that they connect to the exact same vertices.

cleanup(Set, Object) - Static method in class edu.uci.ics.jung.utils.UserDataUtils

cleanup(Set, Object, Object) - Static method in class edu.uci.ics.jung.utils.UserDataUtils

cleanup(Set, Object, Object, Object) - Static method in class edu.uci.ics.jung.utils.UserDataUtils

clear() - Method in class edu.uci.ics.jung.graph.decorators.StringLabeller

Wipes the entire table.

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

close() - Method in class edu.uci.ics.jung.utils.StringInputStream

Closes the Stringreader.

clusteringCoefficients(UndirectedGraph) - Static method in class edu.uci.ics.jung.statistics.GraphStatistics

For each vertex, the net fraction of edges that actually exist in the neighborhood of distance 1 around each vertex vs all possible edges that could exist are computed The clustering coefficient measures the degree to which a node's neighbors are neighbors with each other Note: You can use cern.jet.stat.Descriptive to compute various statistics from the DoubleArrayList

compareTo(Object) - Method in class edu.uci.ics.jung.algorithms.importance.Ranking

Compares two ranking based on the rank score.

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

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

componentResized(ComponentEvent) - Method in class edu.uci.ics.jung.visualization.SpringLayout.SpringDimensionChecker

computeMeanFirstPassageMatrix(Graph, Object, DoubleMatrix1D) - Static method in class edu.uci.ics.jung.algorithms.GraphMatrixOperations

Computes the all-pairs mean first passage time for the specified graph, given an existing stationary probability distribution.

computePathData(Edge, Edge) - Method in interface edu.uci.ics.jung.algorithms.MatrixElementOperations

If either e1 or e2 is null, the Object reference returned should be null.

computePathData(Edge, Edge) - Method in class edu.uci.ics.jung.algorithms.RealMatrixElementOperations

computeSTBetweenness(Vertex, Vertex, Vertex) - Method in class edu.uci.ics.jung.algorithms.importance.RandomWalkSTBetweenness

computeVoltagePotentialMatrix(UndirectedGraph) - Static method in class edu.uci.ics.jung.algorithms.GraphMatrixOperations

The idea here is based on the metaphor of an electric circuit.

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

Checks to see whether the graphs contains parallel edges

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

Checks to see whether the graphs contains self-loops

containsUserDatumKey(Object) - Method in class edu.uci.ics.jung.graph.impl.AbstractHyperUnitBPG

containsUserDatumKey(Object) - Method in class edu.uci.ics.jung.utils.UserData

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

Reports whether key is a key of this user data container.

copy(ArchetypeGraph) - Method in interface edu.uci.ics.jung.graph.ArchetypeEdge

Creates a copy of this edge in graph g.

copy() - Method in interface edu.uci.ics.jung.graph.ArchetypeGraph

Performs a deep copy of the graph and its contents.

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

Creates a copy of this vertex in graph g.

copy() - Method in class edu.uci.ics.jung.graph.impl.AbstractArchetypeGraph

Creates a replica of this graph.

copy(ArchetypeGraph) - Method in class edu.uci.ics.jung.graph.impl.AbstractSparseEdge

Creates a copy of this edge in the specified graph nGraph, and copies this edge's user data to the new edge.

copy(ArchetypeGraph) - Method in class edu.uci.ics.jung.graph.impl.AbstractSparseVertex

copy(ArchetypeGraph) - Method in class edu.uci.ics.jung.graph.impl.BipartiteEdge

copy(ArchetypeGraph) - Method in class edu.uci.ics.jung.graph.impl.BipartiteVertex

Specialized copy function for copy FROM BipartiteGraph TO BipartiteGraph

copy(ArchetypeGraph) - Method in class edu.uci.ics.jung.graph.impl.HyperedgeBPG

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

copy(ArchetypeGraph) - Method in class edu.uci.ics.jung.graph.impl.HypervertexBPG

copyLabels(StringLabeller, StringLabeller) - Static method in class edu.uci.ics.jung.utils.GraphUtils

Copies the labels of vertices from one StringLabeller to another.

count - Static variable in class edu.uci.ics.jung.algorithms.blockmodel.StructurallyEquivalent

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

Returns the number of accumulated counts.

count() - Method in class edu.uci.ics.jung.statistics.StatisticalMoments

Returns the number of accumulated counts.

create() - Method in class edu.uci.ics.jung.utils.TypedVertexGenerator

Creates a vertex whose type is determined by the requirements specified in the constructor.

create() - Method in interface edu.uci.ics.jung.utils.VertexGenerator

createDirectedAcyclicGraph(int, int, double) - Static method in class edu.uci.ics.jung.utils.TestGraphs

Creates a sample directed acyclic graph by generating several "layers", and connecting nodes (randomly) to nodes in earlier (but never later) layers.

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

Returns the corresponding cluster set in the other graph.

createEquivalentClusterSet(Graph) - Method in class edu.uci.ics.jung.algorithms.cluster.EdgeClusterSet

Creates a new cluster set where each edge and cluster in the new cluster set correspond 1-to-1 with those in the original graph

createEquivalentClusterSet(Graph) - Method in class edu.uci.ics.jung.algorithms.cluster.VertexClusterSet

Creates a new cluster set where each vertex and cluster in the new cluster set correspond 1-to-1 with those in the original graph

createHistogram(DoubleArrayList, double, int, double) - Static method in class edu.uci.ics.jung.statistics.GraphStatistics

Creates a histogram from a sequence of doubles

createTestGraph(boolean) - Static method in class edu.uci.ics.jung.utils.TestGraphs

Creates a small sample graph that can be used for testing purposes.

createVertexDegreeDiagonalMatrix(Graph) - Static method in class edu.uci.ics.jung.algorithms.GraphMatrixOperations

Returns a diagonal matrix whose diagonal entries contain the degree for the corresponding node.