- e_bent - Variable in class samples.graph.PluggableRendererDemo
-
- e_color - Variable in class samples.graph.PluggableRendererDemo
-
- e_cubic - Variable in class samples.graph.PluggableRendererDemo
-
- e_darrow_pred - Variable in class samples.graph.PluggableRendererDemo
-
- e_labels - Variable in class samples.graph.PluggableRendererDemo
-
- e_line - Variable in class samples.graph.PluggableRendererDemo
-
- e_quad - Variable in class samples.graph.PluggableRendererDemo
-
- e_show_d - Variable in class samples.graph.PluggableRendererDemo
-
- e_show_u - Variable in class samples.graph.PluggableRendererDemo
-
- e_uarrow_pred - Variable in class samples.graph.PluggableRendererDemo
-
- e_wedge - Variable in class samples.graph.PluggableRendererDemo
-
- edge - Variable in class edu.uci.ics.jung.algorithms.importance.EdgeRanking
-
The edge that was ranked.
- Edge - Interface in edu.uci.ics.jung.graph
-
A specific type of ArchetypeEdge
that connects exactly
two instances of Vertex
.
- EDGE - Static variable in class edu.uci.ics.jung.graph.impl.HypergraphBPG
-
Deprecated.
- edge - Variable in class edu.uci.ics.jung.visualization.control.PickingGraphMousePlugin
-
the picked Edge, if any
- Edge<V> - Interface in scratch.tom.simpleGraph
-
Edge is parameterized for a particular vertex
type.
- Edge.Directed<W> - Interface in scratch.tom.simpleGraph
-
Directed adds two methods to Edge
- Edge.Hyper<W> - Interface in scratch.tom.simpleGraph
-
Hyper adds several methods to Edge
- EDGE_ADDITION - Static variable in interface edu.uci.ics.jung.graph.event.GraphEventType
-
- EDGE_AND_VERTEX_BOTH - Static variable in class samples.preview_new_graphdraw.impl.GraphLayoutPanel
-
Both an edge event or a vertex event is fired from this panel.
- EDGE_AND_VERTEX_POLICY - Static variable in class samples.preview_new_graphdraw.impl.GraphLayoutPanel
-
Either an edge event or a vertex event is fired from this panel.
- EDGE_CLICK_THRESHOLD - Static variable in class samples.preview_new_graphdraw.impl.GraphLayoutPanelMouseListener
-
- edge_first - Variable in class edu.uci.ics.jung.io.HypergraphReader
-
- edge_index - Variable in class edu.uci.ics.jung.utils.DefaultParallelEdgeIndexFunction
-
- edge_index - Variable in class edu.uci.ics.jung.utils.ParallelEdgeIndexSingleton
-
- EDGE_ONLY_POLICY - Static variable in class samples.preview_new_graphdraw.impl.GraphLayoutPanel
-
Only edge events are fired from this panel.
- EDGE_REMOVAL - Static variable in interface edu.uci.ics.jung.graph.event.GraphEventType
-
- edge_requirements - Variable in class edu.uci.ics.jung.graph.impl.AbstractArchetypeGraph
-
- edge_value - Variable in class scratch.joshua.ranking.AbstractRanker
-
- EDGE_WEIGHT - Static variable in class edu.uci.ics.jung.io.PajekNetFile
-
Deprecated.
- edge_weight - Variable in class samples.graph.PluggableRendererDemo
-
- EDGE_WEIGHT - Static variable in class test.edu.uci.ics.jung.algorithms.importance.TestKStepMarkov
-
- edge_weights - Variable in class edu.uci.ics.jung.algorithms.importance.VoltageRanker
-
- edgeAdded(GraphEvent) - Method in interface edu.uci.ics.jung.graph.event.GraphEventListener
-
- edgeAdded(GraphEvent) - Method in class edu.uci.ics.jung.utils.SubsetManager
-
Adds the edge whose event this is to all appropriate subsets.
- edgeAdded(GraphEvent) - Method in class test.edu.uci.ics.jung.graph.event.TestGraphEventListener.EventConsistencyChecker
-
- EdgeArrowFunction - Interface in edu.uci.ics.jung.graph.decorators
-
- edgeArrowFunction - Variable in class edu.uci.ics.jung.visualization.PluggableRenderer
-
- edgeArrowPredicate - Variable in class edu.uci.ics.jung.visualization.PluggableRenderer
-
- EdgeBetweennessClusterer - Class in edu.uci.ics.jung.algorithms.cluster
-
An algorithm for computing clusters (community structure) in graphs based on edge betweenness.
- EdgeBetweennessClusterer(int) - Constructor for class edu.uci.ics.jung.algorithms.cluster.EdgeBetweennessClusterer
-
Constructs a new clusterer for the specified graph.
- edgeClicked(ClickEvent) - Method in interface samples.preview_new_graphdraw.event.ClickListener
-
- edgeClicked(ClickEvent) - Method in class samples.preview_new_graphdraw.impl.crooked.CrookedRun.Selecter
-
- EdgeClusterSet - Class in edu.uci.ics.jung.algorithms.cluster
-
A ClusterSet where each cluster is a set of edge
- EdgeClusterSet(Graph) - Constructor for class edu.uci.ics.jung.algorithms.cluster.EdgeClusterSet
-
Constructs and initializes the set
- edgeColor - Variable in class edu.uci.ics.jung.visualization.graphdraw.SettableRenderer
-
Deprecated.
- EdgeColorFunction - Interface in edu.uci.ics.jung.graph.decorators
-
Deprecated.
Use EdgePaintFunction instead
- edgeColorFunction - Variable in class edu.uci.ics.jung.visualization.graphdraw.SettableRenderer
-
Deprecated.
- EdgeColorToEdgePaintFunctionConverter - Class in edu.uci.ics.jung.visualization
-
Deprecated.
This utility class converts an EdgeColorFunction into an EdgePaintFunction
- EdgeColorToEdgePaintFunctionConverter(EdgeColorFunction) - Constructor for class edu.uci.ics.jung.visualization.EdgeColorToEdgePaintFunctionConverter
-
Deprecated.
- edgedx - Variable in class edu.uci.ics.jung.visualization.SpringLayout.SpringVertexData
-
- edgedx - Variable in class samples.preview_new_graphdraw.iterablelayouts.SpringLayout.SpringVertex
-
- edgedx - Variable in class scratch.danyel.sample.CircleLayout.CircleVertexData
-
- edgedx - Variable in class scratch.scott.AestheticSpringVisualizer.SpringVertexData
-
- edgedy - Variable in class edu.uci.ics.jung.visualization.SpringLayout.SpringVertexData
-
- edgedy - Variable in class samples.preview_new_graphdraw.iterablelayouts.SpringLayout.SpringVertex
-
- edgedy - Variable in class scratch.danyel.sample.CircleLayout.CircleVertexData
-
- edgedy - Variable in class scratch.scott.AestheticSpringVisualizer.SpringVertexData
-
- EdgeFontFunction - Interface in edu.uci.ics.jung.graph.decorators
-
- edgeFontFunction - Variable in class edu.uci.ics.jung.visualization.PluggableRenderer
-
- edgeIncludePredicate - Variable in class edu.uci.ics.jung.visualization.PluggableRenderer
-
- edgeLabelClosenessFunction - Variable in class edu.uci.ics.jung.visualization.PluggableRenderer
-
- EdgeLabelDemo - Class in samples.graph
-
Demonstrates jung support for drawing edge labels that
can be positioned at any point along the edge, and can
be rotated to be parallel with the edge.
- EdgeLabelDemo() - Constructor for class samples.graph.EdgeLabelDemo
-
create an instance of a simple graph with controls to
demo the label positioning features
- edgeMap - Variable in class edu.uci.ics.jung.utils.SubsetManager
-
- edgeOffset - Variable in class edu.uci.ics.jung.visualization.control.LensTranslatingGraphMousePlugin
-
- edgePaint - Variable in class samples.graph.PluggableRendererDemo
-
- EdgePaintFunction - Interface in edu.uci.ics.jung.graph.decorators
-
This class replaces EdgeColorFunction.
- edgePaintFunction - Variable in class edu.uci.ics.jung.visualization.PluggableRenderer
-
- EdgePartition - Class in scratch.scott.partition
-
- EdgePartition(ArchetypeGraph) - Constructor for class scratch.scott.partition.EdgePartition
-
- EdgePartitionClass - Class in scratch.scott.partition
-
- EdgePartitionClass(AbstractPartition) - Constructor for class scratch.scott.partition.EdgePartitionClass
-
- EdgePermuter - Interface in edu.uci.ics.jung.random.permuters
-
An interface for algorithms that randomly permute edges according to some distribution or other mechanism
- edgePicked(ArchetypeEdge) - Method in interface edu.uci.ics.jung.visualization.PickEventListener
-
Deprecated.
- EdgePredicate - Class in edu.uci.ics.jung.graph.predicates
-
- EdgePredicate() - Constructor for class edu.uci.ics.jung.graph.predicates.EdgePredicate
-
- EdgePredicateFilter - Class in edu.uci.ics.jung.graph.filters
-
This is a simple Edge filter that accepts the edges which its
Predicate accepts.
- EdgePredicateFilter(EdgePredicate) - Constructor for class edu.uci.ics.jung.graph.filters.EdgePredicateFilter
-
- EdgePredicateFilter(Predicate) - Constructor for class edu.uci.ics.jung.graph.filters.EdgePredicateFilter
-
- EdgePredicateTest - Class in test.edu.uci.ics.jung.graph.predicates
-
- EdgePredicateTest() - Constructor for class test.edu.uci.ics.jung.graph.predicates.EdgePredicateTest
-
- EdgeRanking - Class in edu.uci.ics.jung.algorithms.importance
-
A data container for an edge ranking which stores:
the rank score
the original position of the edge before the ranking were generated
a reference to the edge itself
- EdgeRanking(int, double, Edge) - Constructor for class edu.uci.ics.jung.algorithms.importance.EdgeRanking
-
Simple constructor that allows all data elements to be initialized on construction.
- EdgeRegistry - Class in scratch.scott.registry
-
- EdgeRegistry(Graph) - Constructor for class scratch.scott.registry.EdgeRegistry
-
- edgeRemoved(GraphEvent) - Method in interface edu.uci.ics.jung.graph.event.GraphEventListener
-
- edgeRemoved(GraphEvent) - Method in class edu.uci.ics.jung.utils.SubsetManager
-
Removes the edge whose event this is from all appropriate subsets.
- edgeRemoved(GraphEvent) - Method in class test.edu.uci.ics.jung.graph.event.TestGraphEventListener.EventConsistencyChecker
-
- EdgeRenderer - Interface in samples.preview_new_graphdraw
-
An EdgeRenderer is responsible for rendering every VisEdge that comes its
way
- edges - Variable in class edu.uci.ics.jung.graph.impl.SetHypergraph
-
- EDGES - Static variable in class scratch.danyel.LittleTest
-
- edges - Variable in class scratch.joshua.jung_2_0.core.SimpleDirectedSparseGraph
-
- edges - Variable in class scratch.joshua.jung_2_0.core.SimpleUndirectedSparseGraph
-
- edges - Variable in class test.edu.uci.ics.jung.algorithms.GraphMatrixOperationsTest
-
- edgeSet - Variable in class edu.uci.ics.jung.graph.filters.UnassembledGraph
-
- edgeSetToGraph(Set, boolean) - Static method in class edu.uci.ics.jung.utils.GraphUtils
-
Given a set of edges, creates a new Graph that contains all
of those edges, and at least all the vertices that are attached to them.
- EdgeShape - Class in edu.uci.ics.jung.graph.decorators
-
An interface for decorators that return a
Shape
for a specified edge.
- EdgeShape() - Constructor for class edu.uci.ics.jung.graph.decorators.EdgeShape
-
- EdgeShape.BentLine - Class in edu.uci.ics.jung.graph.decorators
-
An edge shape that renders as a bent-line between the
vertex endpoints.
- EdgeShape.BentLine() - Constructor for class edu.uci.ics.jung.graph.decorators.EdgeShape.BentLine
-
- EdgeShape.CubicCurve - Class in edu.uci.ics.jung.graph.decorators
-
An edge shape that renders as a CubicCurve between vertex
endpoints.
- EdgeShape.CubicCurve() - Constructor for class edu.uci.ics.jung.graph.decorators.EdgeShape.CubicCurve
-
- EdgeShape.Line - Class in edu.uci.ics.jung.graph.decorators
-
An edge shape that renders as a straight line between
the vertex endpoints.
- EdgeShape.Line() - Constructor for class edu.uci.ics.jung.graph.decorators.EdgeShape.Line
-
- EdgeShape.Loop - Class in edu.uci.ics.jung.graph.decorators
-
An edge shape that renders as a loop with its nadir at the
center of the vertex.
- EdgeShape.Loop() - Constructor for class edu.uci.ics.jung.graph.decorators.EdgeShape.Loop
-
- EdgeShape.ParallelRendering - Interface in edu.uci.ics.jung.graph.decorators
-
- EdgeShape.QuadCurve - Class in edu.uci.ics.jung.graph.decorators
-
An edge shape that renders as a QuadCurve between vertex
endpoints.
- EdgeShape.QuadCurve() - Constructor for class edu.uci.ics.jung.graph.decorators.EdgeShape.QuadCurve
-
- EdgeShape.SimpleLoop - Class in edu.uci.ics.jung.graph.decorators
-
An edge shape that renders as a loop with its nadir at the center of the
vertex.
- EdgeShape.SimpleLoop() - Constructor for class edu.uci.ics.jung.graph.decorators.EdgeShape.SimpleLoop
-
- EdgeShape.Wedge - Class in edu.uci.ics.jung.graph.decorators
-
An edge shape that renders as an isosceles triangle whose
apex is at the destination vertex for directed edges,
and as a "bowtie" shape for undirected edges.
- EdgeShape.Wedge(int) - Constructor for class edu.uci.ics.jung.graph.decorators.EdgeShape.Wedge
-
- EdgeShapeFunction - Interface in edu.uci.ics.jung.graph.decorators
-
An interface for decorators that return a
Shape
for a specified edge.
- edgeShapeFunction - Variable in class edu.uci.ics.jung.visualization.PluggableRenderer
-
- EdgeStringer - Interface in edu.uci.ics.jung.graph.decorators
-
An EdgeStringer provides a string Label for any edge.
- edgeStringer - Variable in class edu.uci.ics.jung.visualization.PluggableRenderer
-
- EdgeStrokeFunction - Interface in edu.uci.ics.jung.graph.decorators
-
- edgeStrokeFunction - Variable in class edu.uci.ics.jung.visualization.PluggableRenderer
-
- edgeThickness - Variable in class edu.uci.ics.jung.visualization.graphdraw.SettableRenderer
-
Deprecated.
- EdgeThicknessFunction - Interface in edu.uci.ics.jung.graph.decorators
-
Deprecated.
Use EdgeStrokeFunction
instead.
- edgeThicknessFunction - Variable in class edu.uci.ics.jung.visualization.graphdraw.SettableRenderer
-
Deprecated.
- EdgeThicknessToEdgeStrokeFunctionConverter - Class in edu.uci.ics.jung.visualization
-
Converts an EdgeThicknessFunction
into an EdgeStrokeFunction
.
- EdgeThicknessToEdgeStrokeFunctionConverter(EdgeThicknessFunction) - Constructor for class edu.uci.ics.jung.visualization.EdgeThicknessToEdgeStrokeFunctionConverter
-
- edgeUnpicked(ArchetypeEdge) - Method in interface edu.uci.ics.jung.visualization.PickEventListener
-
Deprecated.
- EdgeVertexNumberFunction - Interface in scratch.joshua.ranking
-
An interface for classes that can store and retrieve a
value for an edge with respect to a specific incident vertex.
- EdgeWeightLabeller - Class in edu.uci.ics.jung.graph.decorators
-
A EdgeWeightLabeller applies a label to the edges of a Graph.
- EdgeWeightLabellerStringer - Class in edu.uci.ics.jung.graph.decorators
-
An EdgeStringer provides a string Label for any edge: the
String is the Weight produced by the EdgeWeightLabeller that
it takes as input.
- EdgeWeightLabellerStringer(EdgeWeightLabeller) - Constructor for class edu.uci.ics.jung.graph.decorators.EdgeWeightLabellerStringer
-
- EDITING - Static variable in class edu.uci.ics.jung.visualization.control.ModalGraphMouse.Mode
-
- EditingGraphMousePlugin - Class in edu.uci.ics.jung.visualization.control
-
A plugin that can create vertices, undirected edges, and directed edges
using mouse gestures.
- EditingGraphMousePlugin() - Constructor for class edu.uci.ics.jung.visualization.control.EditingGraphMousePlugin
-
- EditingGraphMousePlugin(int) - Constructor for class edu.uci.ics.jung.visualization.control.EditingGraphMousePlugin
-
create instance and prepare shapes for visual effects
- EditingModalGraphMouse - Class in edu.uci.ics.jung.visualization.control
-
- EditingModalGraphMouse() - Constructor for class edu.uci.ics.jung.visualization.control.EditingModalGraphMouse
-
create an instance with default values
- EditingModalGraphMouse(float, float) - Constructor for class edu.uci.ics.jung.visualization.control.EditingModalGraphMouse
-
create an instance with passed values
- editingPlugin - Variable in class edu.uci.ics.jung.visualization.control.EditingModalGraphMouse
-
- EditingPopupGraphMousePlugin - Class in edu.uci.ics.jung.visualization.control
-
a plugin that uses popup menus to create vertices, undirected edges,
and directed edges.
- EditingPopupGraphMousePlugin(SettableVertexLocationFunction) - Constructor for class edu.uci.ics.jung.visualization.control.EditingPopupGraphMousePlugin
-
- EdmondsKarpMaxFlow - Class in edu.uci.ics.jung.algorithms.flows
-
Implements the EdmondsKarpMaxFlow algorithm for solving the maximum flow problem.
- EdmondsKarpMaxFlow(DirectedGraph, Vertex, Vertex, String, String) - Constructor for class edu.uci.ics.jung.algorithms.flows.EdmondsKarpMaxFlow
-
Constructs a new instance of the algorithm solver for a given graph, source, and sink.
- edu.uci.ics.jung.algorithms - package edu.uci.ics.jung.algorithms
-
Provides a set of specialized algorithms for computing various measures on graphs as well as transforming graphs in different ways.
- edu.uci.ics.jung.algorithms.blockmodel - package edu.uci.ics.jung.algorithms.blockmodel
-
Implementations of a notion of graph equivalence for blockmodeling, and a mechanism for collapsing blocks.
- edu.uci.ics.jung.algorithms.cluster - package edu.uci.ics.jung.algorithms.cluster
-
Provides a series of methods for locating clusters in graphs according to some model-based, heuristic or graph-theoretic criteria.
- edu.uci.ics.jung.algorithms.connectivity - package edu.uci.ics.jung.algorithms.connectivity
-
Provides a series of methods for computing various aspects of a graph's overall connectivity structure.
- edu.uci.ics.jung.algorithms.flows - package edu.uci.ics.jung.algorithms.flows
-
Provides a series of methods for solving the s-t max flow and other network flow problems.
- edu.uci.ics.jung.algorithms.importance - package edu.uci.ics.jung.algorithms.importance
-
Provides a set of algorithms for computing the importance of each node (or edge)
in a graph relative to all others (or, for the algorithms that inherit from
RelativeAuthorityRanker
, relative to a specified subset of elements).
- edu.uci.ics.jung.algorithms.metrics - package edu.uci.ics.jung.algorithms.metrics
-
- edu.uci.ics.jung.algorithms.shortestpath - package edu.uci.ics.jung.algorithms.shortestpath
-
Provides a set of algorithms for computing the shortest path between two nodes or between each pair of nodes in a graph.
- edu.uci.ics.jung.algorithms.transformation - package edu.uci.ics.jung.algorithms.transformation
-
- edu.uci.ics.jung.exceptions - package edu.uci.ics.jung.exceptions
-
Provides customized exceptions for the JUNG framework.
- edu.uci.ics.jung.graph - package edu.uci.ics.jung.graph
-
Specifies the interfaces for and capabilities of the JUNG vertex, edge, and graph classes.
- edu.uci.ics.jung.graph.decorators - package edu.uci.ics.jung.graph.decorators
-
Provides mechanisms for annotating nodes consistently with useful information.
- edu.uci.ics.jung.graph.event - package edu.uci.ics.jung.graph.event
-
- edu.uci.ics.jung.graph.filters - package edu.uci.ics.jung.graph.filters
-
Provides for a filtering mechanism that produces subgraphs of an original graph.
- edu.uci.ics.jung.graph.filters.impl - package edu.uci.ics.jung.graph.filters.impl
-
Provides sample implementations and generally useful filters.
- edu.uci.ics.jung.graph.impl - package edu.uci.ics.jung.graph.impl
-
Implementations of the JUNG vertex, edge, and graph interfaces.
- edu.uci.ics.jung.graph.predicates - package edu.uci.ics.jung.graph.predicates
-
A Predicate
tests whether an Object
satisfies a specific
implementation-defined property.
- edu.uci.ics.jung.io - package edu.uci.ics.jung.io
-
Provides a set of graph file format interpreters for loading graphs from disk.
- edu.uci.ics.jung.random.generators - package edu.uci.ics.jung.random.generators
-
Provides a series of methods for generating new graphs with various properties.
- edu.uci.ics.jung.random.permuters - package edu.uci.ics.jung.random.permuters
-
Provides a series of methods for permuting graphs in different ways.
- edu.uci.ics.jung.statistics - package edu.uci.ics.jung.statistics
-
Provides a set of statistical tools for analyzing graphs.
- edu.uci.ics.jung.utils - package edu.uci.ics.jung.utils
-
Provides a series of useful utility methods, and a number of custom helper classes designed specifically for this application.
- edu.uci.ics.jung.visualization - package edu.uci.ics.jung.visualization
-
Provides a visualization mechanism for drawing and rendering Graphs.
- edu.uci.ics.jung.visualization.contrib - package edu.uci.ics.jung.visualization.contrib
-
These are additional layouts contributed by various users.
- edu.uci.ics.jung.visualization.control - package edu.uci.ics.jung.visualization.control
-
- edu.uci.ics.jung.visualization.graphdraw - package edu.uci.ics.jung.visualization.graphdraw
-
Provides support classes for the
GraphDraw
mechanism: generalized functions so users can tweak variables freely when creating with EdgeDraw.
- edu.uci.ics.jung.visualization.subLayout - package edu.uci.ics.jung.visualization.subLayout
-
- edu.uci.ics.jung.visualization.transform - package edu.uci.ics.jung.visualization.transform
-
- edu.uci.ics.jung.visualization.transform.shape - package edu.uci.ics.jung.visualization.transform.shape
-
- effectiveSize(Vertex) - Method in class edu.uci.ics.jung.algorithms.metrics.StructuralHoles
-
Burt's measure of the effective size of a vertex's network.
- efficiency(Vertex) - Method in class edu.uci.ics.jung.algorithms.metrics.StructuralHoles
-
Returns the effective size of v
divided by the number of
alters in v
's network.
- EfficientFilter - Interface in edu.uci.ics.jung.graph.filters
-
An EfficientFilter can take in an UnassembledGraph
withut assembling it, and is used for non-structural
filters.
- EigenvectorCentralityRanker - Class in scratch.joshua.ranking
-
- EigenvectorCentralityRanker(Graph, int, double) - Constructor for class scratch.joshua.ranking.EigenvectorCentralityRanker
-
- EigenvectorCentralityRanker(Graph, NumberEdgeValue, int, double) - Constructor for class scratch.joshua.ranking.EigenvectorCentralityRanker
-
- EigenvectorCentralityRanker(Graph, NumberVertexValue, NumberEdgeValue, int, double) - Constructor for class scratch.joshua.ranking.EigenvectorCentralityRanker
-
- Element - Interface in edu.uci.ics.jung.graph
-
An interface for elements (vertices and edges) of generalized graphs.
- elementAccessor - Variable in class edu.uci.ics.jung.visualization.ISOMLayout
-
- elementAccessor - Variable in class edu.uci.ics.jung.visualization.PersistentLayoutImpl
-
- ellipse - Variable in class edu.uci.ics.jung.visualization.transform.LensTransformer
-
the area affected by the transform
- EllipseVertexShapeFunction - Class in edu.uci.ics.jung.graph.decorators
-
- EllipseVertexShapeFunction() - Constructor for class edu.uci.ics.jung.graph.decorators.EllipseVertexShapeFunction
-
- EllipseVertexShapeFunction(VertexSizeFunction, VertexAspectRatioFunction) - Constructor for class edu.uci.ics.jung.graph.decorators.EllipseVertexShapeFunction
-
- emit() - Method in class samples.preview_new_graphdraw.iter.IterableLayout
-
Creates some sort of layout that has all the same vertex and edge
locations.
- emit() - Method in class samples.preview_new_graphdraw.iterablelayouts.WrappedIterableLayout
-
- emit() - Method in interface samples.preview_new_graphdraw.LayoutEmitter
-
- emit() - Method in class samples.preview_new_graphdraw.StaticLayout
-
this is a copy of this layout that the code can freely stomp on.
- emitProlog() - Method in class scratch.scott.PSGr
-
Top of every PS file needs this.
- emitted - Variable in class samples.preview_new_graphdraw.staticlayouts.IterableFromStaticEmittedLayout
-
- EmittedLayout - Class in samples.preview_new_graphdraw
-
- EmittedLayout() - Constructor for class samples.preview_new_graphdraw.EmittedLayout
-
- emitThis(String) - Method in class scratch.scott.PSGr
-
- emitThisNext(String) - Method in class scratch.scott.PSGr
-
- enableCaching(boolean) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance
-
Specifies whether or not this instance of DijkstraShortestPath
should cache its results (final and partial) for future reference.
- end - Variable in class samples.preview_new_graphdraw.iterablelayouts.InterpolatingIterableLayout
-
- energy - Variable in class samples.preview_new_graphdraw.iterablelayouts.KKLayout
-
- energyDelta - Variable in class samples.preview_new_graphdraw.iterablelayouts.KKLayout
-
- enforcesDirected(Graph) - Static method in class edu.uci.ics.jung.utils.PredicateUtils
-
Returns true
if g
is constrained to only
accept directed edges, and false otherwise.
- enforcesEdgeConstraint(ArchetypeGraph, Predicate) - Static method in class edu.uci.ics.jung.utils.PredicateUtils
-
Returns true
if p
is an edge
constraint of g
, and false
otherwise.
- enforcesNotParallel(Graph) - Static method in class edu.uci.ics.jung.utils.PredicateUtils
-
Returns true
if g
is constrained to
reject parallel edges.
- enforcesUndirected(Graph) - Static method in class edu.uci.ics.jung.utils.PredicateUtils
-
Returns true
if g
is constrained to only
accept undirected edges.
- enforcesVertexConstraint(ArchetypeGraph, Predicate) - Static method in class edu.uci.ics.jung.utils.PredicateUtils
-
Returns true
if p
is an edge
constraint of g
, and false
otherwise.
- entropy(double[]) - Static method in class edu.uci.ics.jung.statistics.DiscreteDistribution
-
Returns the entropy of this distribution.
- entrySet() - Method in class scratch.joshua.jung_2_0.decoration.TestMap
-
- EppsteinPowerLawGenerator - Class in edu.uci.ics.jung.random.generators
-
Graph generator that generates undirected sparse graphs with power-law distributions.
- EppsteinPowerLawGenerator(int, int, int) - Constructor for class edu.uci.ics.jung.random.generators.EppsteinPowerLawGenerator
-
Constructor which specifies the parameters of the generator
- equal(double, double) - Static method in class edu.uci.ics.jung.utils.NumericalPrecision
-
- equal(double, double, double) - Static method in class edu.uci.ics.jung.utils.NumericalPrecision
-
- equals(Object) - Method in class edu.uci.ics.jung.graph.impl.AbstractArchetypeEdge
-
Returns true
if o
is an instance of
ArchetypeEdge
that is equivalent to this edge.
- equals(Object) - Method in class edu.uci.ics.jung.graph.impl.AbstractArchetypeVertex
-
Returns true
if o
is an instance of
ArchetypeVertex
that is equivalent to this vertex.
- equals(Object) - Method in class edu.uci.ics.jung.graph.impl.AbstractHyperUnitBPG
-
Deprecated.
- equals(Object) - Method in class edu.uci.ics.jung.graph.predicates.KPartiteEdgePredicate
-
- equals(Object) - Method in class edu.uci.ics.jung.graph.predicates.NotInGraphEdgePredicate
-
- equals(Object) - Method in class edu.uci.ics.jung.graph.predicates.NotInGraphVertexPredicate
-
- equals(Object) - Method in class edu.uci.ics.jung.graph.predicates.UserDatumEdgePredicate
-
Tests equality based on underlying objects
- equals(Object) - Method in class edu.uci.ics.jung.graph.predicates.UserDatumVertexPredicate
-
Tests equality based on underlying objects
- equals(Object) - Method in class edu.uci.ics.jung.utils.MutableDouble
-
Compares this object to the specified object.
- equals(Object) - Method in class edu.uci.ics.jung.utils.MutableInteger
-
Compares this object to the specified object.
- equals(Object) - Method in class edu.uci.ics.jung.utils.Pair
-
- equals(Object) - Method in class edu.uci.ics.jung.visualization.transform.shape.GraphicsDecorator
-
- equals(Object) - Method in class edu.uci.ics.jung.visualization.transform.shape.PluggableRendererDecorator
-
- equals(Object) - Method in class samples.preview_new_graphdraw.Coordinates
-
- equals(Object) - Method in class scratch.joshua.jung_2_0.utils.Pair
-
- equals(Object) - Method in class test.edu.uci.ics.jung.utils.UserDataTest.TestDataHolder
-
- EquivalenceAlgorithm - Interface in edu.uci.ics.jung.algorithms.blockmodel
-
Any blockmodel equivalence algorithm should implement this method;
it allows users to access EquivalenceAlgorithms more easily.
- EquivalenceRelation - Class in edu.uci.ics.jung.algorithms.blockmodel
-
An EquivalenceRelation holds a number of Equivalent vertices from the
same graph.
- EquivalenceRelation(Set, Graph) - Constructor for class edu.uci.ics.jung.algorithms.blockmodel.EquivalenceRelation
-
Input is the basic data structure underneath: a Set of Sets.
- ErdosRenyiGenerator - Class in edu.uci.ics.jung.random.generators
-
Random Generator of Erdos-Renyi "binomial model"
- ErdosRenyiGenerator(int, double) - Constructor for class edu.uci.ics.jung.random.generators.ErdosRenyiGenerator
-
- errorOnAverage() - Method in class edu.uci.ics.jung.statistics.Histogram
-
Returns the error on average.
- errorOnAverage() - Method in class edu.uci.ics.jung.statistics.StatisticalMoments
-
Returns the error on average.
- es - Variable in class samples.graph.PluggableRendererDemo
-
- es_none - Variable in class samples.graph.PluggableRendererDemo
-
- estimatedDistances - Variable in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance.SourceData
-
- etf - Variable in class edu.uci.ics.jung.visualization.EdgeThicknessToEdgeStrokeFunctionConverter
-
- evaluate() - Method in class edu.uci.ics.jung.algorithms.IterativeProcess
-
Performs the iterative process.
- evaluate(Object) - Method in class edu.uci.ics.jung.graph.impl.AbstractArchetypeGraph.Requirements
-
- evaluate(Object) - Method in class edu.uci.ics.jung.graph.predicates.EdgePredicate
-
- evaluate(Object) - Method in class edu.uci.ics.jung.graph.predicates.GraphPredicate
-
- evaluate(Object) - Method in class edu.uci.ics.jung.graph.predicates.ThresholdPredicate
-
- evaluate(Object) - Method in class edu.uci.ics.jung.graph.predicates.VertexPredicate
-
- evaluate(Object) - Method in class edu.uci.ics.jung.io.PajekNetReader.ListTagPred
-
- evaluate(Object) - Method in class edu.uci.ics.jung.io.PajekNetReader.TagPred
-
- evaluate(NumberVertexValue, NumberVertexValue, NumberVertexValue, NumberVertexValue) - Method in class scratch.joshua.ranking.HITSRanker
-
Essentially, calls advance() until one of the termination conditions
is met (max iterations passed or all changes below tolerance).
- evaluate(NumberVertexValue, NumberVertexValue) - Method in class scratch.joshua.ranking.HITSRanker
-
- evaluate(NumberVertexValue, NumberVertexValue) - Method in class scratch.joshua.ranking.SingleValueRanker
-
- evaluate(NumberVertexValue) - Method in class scratch.joshua.ranking.SingleValueRanker
-
- evaluate(NumberVertexValue) - Method in class scratch.joshua.ranking.WeightedDegreeRanker
-
- evaluate(NumberVertexValue, NumberVertexValue) - Method in class scratch.joshua.ranking.WeightedDegreeRanker
-
- evaluateDirectedEdge(DirectedEdge, Iterator) - Method in class edu.uci.ics.jung.graph.predicates.ParallelEdgePredicate
-
- evaluateEdge(ArchetypeEdge) - Method in class edu.uci.ics.jung.graph.predicates.EdgePredicate
-
- evaluateEdge(ArchetypeEdge) - Method in class edu.uci.ics.jung.graph.predicates.KPartiteEdgePredicate
-
- evaluateEdge(ArchetypeEdge) - Method in class edu.uci.ics.jung.graph.predicates.NotInGraphEdgePredicate
-
Returns true
if this edge is not currently
part of graph ag
.
- evaluateEdge(ArchetypeEdge) - Method in class edu.uci.ics.jung.graph.predicates.ParallelEdgePredicate
-
Returns true
if there exists an
edge which is parallel to the specified edge.
- evaluateEdge(ArchetypeEdge) - Method in class edu.uci.ics.jung.graph.predicates.ReciprocatedDirectedEdgePredicate
-
- evaluateEdge(ArchetypeEdge) - Method in class edu.uci.ics.jung.graph.predicates.SelfLoopEdgePredicate
-
Returns true
if e
is an
Edge
that connects a vertex to itself.
- evaluateEdge(ArchetypeEdge) - Method in class edu.uci.ics.jung.graph.predicates.SimpleEdgePredicate
-
Returns true
if ae
is neither a
self-loop nor parallel to an existing edge.
- evaluateEdge(ArchetypeEdge) - Method in class edu.uci.ics.jung.graph.predicates.TreePredicate
-
Any edges added to this graph must go to a vertex where
- evaluateEdge(ArchetypeEdge) - Method in class edu.uci.ics.jung.graph.predicates.UserDatumEdgePredicate
-
Returns true
if the datum stored by e
with
key value key
(in the user data repository) is
datum
.
- evaluateGraph(ArchetypeGraph) - Method in class edu.uci.ics.jung.graph.predicates.CliqueGraphPredicate
-
- evaluateGraph(ArchetypeGraph) - Method in class edu.uci.ics.jung.graph.predicates.ConnectedGraphPredicate
-
Returns true
if there exists a path from each
vertex to all other vertices (ignoring edge direction).
- evaluateGraph(ArchetypeGraph) - Method in class edu.uci.ics.jung.graph.predicates.GraphPredicate
-
- evaluateIncoming(NumberVertexValue) - Method in class scratch.joshua.ranking.WeightedDegreeRanker
-
- evaluateIteration() - Method in class edu.uci.ics.jung.algorithms.flows.EdmondsKarpMaxFlow
-
- evaluateIteration() - Method in class edu.uci.ics.jung.algorithms.importance.BaryCenter
-
- evaluateIteration() - Method in class edu.uci.ics.jung.algorithms.importance.BetweennessCentrality
-
- evaluateIteration() - Method in class edu.uci.ics.jung.algorithms.importance.DegreeDistributionRanker
-
- evaluateIteration() - Method in class edu.uci.ics.jung.algorithms.importance.HITS
-
- evaluateIteration() - Method in class edu.uci.ics.jung.algorithms.importance.HITSWithPriors
-
- evaluateIteration() - Method in class edu.uci.ics.jung.algorithms.importance.KStepMarkov
-
- evaluateIteration() - Method in class edu.uci.ics.jung.algorithms.importance.MarkovCentrality
-
- evaluateIteration() - Method in class edu.uci.ics.jung.algorithms.importance.PageRank
-
- evaluateIteration() - Method in class edu.uci.ics.jung.algorithms.importance.RandomWalkBetweenness
-
- evaluateIteration() - Method in class edu.uci.ics.jung.algorithms.importance.RandomWalkSTBetweenness
-
- evaluateIteration() - Method in class edu.uci.ics.jung.algorithms.importance.WeightedNIPaths
-
- evaluateIteration() - Method in class edu.uci.ics.jung.algorithms.IterativeProcess
-
Evaluate the result of the current interation.
- evaluateIteration() - Method in class scratch.scott.BrandesBetweennessCentrality
-
- evaluateIteration() - Method in class scratch.scott.NewmanBetweennessCentrality
-
- evaluateIteration() - Method in class scratch.scott.optimization.SimulatedAnnealer
-
- evaluateNestedPredicates(Predicate, Object) - Static method in class edu.uci.ics.jung.utils.PredicateUtils
-
Returns a Map
of each constituent predicate of p
(if any) to the result of evaluating this predicate on o
.
- evaluateOutgoing(NumberVertexValue) - Method in class scratch.joshua.ranking.WeightedDegreeRanker
-
- evaluateUndirectedEdge(UndirectedEdge, Iterator) - Method in class edu.uci.ics.jung.graph.predicates.ParallelEdgePredicate
-
- evaluateVertex(ArchetypeVertex) - Method in class edu.uci.ics.jung.graph.predicates.ContainsUserDataKeyVertexPredicate
-
- evaluateVertex(ArchetypeVertex) - Method in class edu.uci.ics.jung.graph.predicates.IsolatedVertexPredicate
-
Returns true
if the argument is a Vertex
whose degree is 0.
- evaluateVertex(ArchetypeVertex) - Method in class edu.uci.ics.jung.graph.predicates.NotInGraphVertexPredicate
-
Returns true
if this vertex is not currently
a member of any graph.
- evaluateVertex(ArchetypeVertex) - Method in class edu.uci.ics.jung.graph.predicates.SinkVertexPredicate
-
- evaluateVertex(ArchetypeVertex) - Method in class edu.uci.ics.jung.graph.predicates.SourceVertexPredicate
-
- evaluateVertex(ArchetypeVertex) - Method in class edu.uci.ics.jung.graph.predicates.UserDatumVertexPredicate
-
Returns true
if the datum stored by v
with
key value key
(in the user data repository) is
datum
.
- evaluateVertex(ArchetypeVertex) - Method in class edu.uci.ics.jung.graph.predicates.VertexPredicate
-
- evolveGraph(int) - Method in class edu.uci.ics.jung.random.generators.BarabasiAlbertGenerator
-
- evolveGraph(int) - Method in interface edu.uci.ics.jung.random.generators.EvolvingGraphGenerator
-
Instructs the algorithm to evolve the graph N time steps and return
the most current evolved state of the graph
- EvolvingGraphGenerator - Interface in edu.uci.ics.jung.random.generators
-
An interface for algorithms that generate graphs that evolve over time
- ewcs - Variable in class samples.graph.PluggableRendererDemo
-
- ewl - Variable in class edu.uci.ics.jung.graph.decorators.EdgeWeightLabellerStringer
-
- ExactFlowCommunity - Class in edu.uci.ics.jung.algorithms.cluster
-
ExactFlowCommunity is an algorithm that uses a set of root nodes that are
supposed to be representative of a community to find the entire community
using principles based on max-flow/min-cut.
- ExactFlowCommunity(int) - Constructor for class edu.uci.ics.jung.algorithms.cluster.ExactFlowCommunity
-
Constructs and initializes the algorithm
- exceptionTest(Graph, int) - Method in class test.edu.uci.ics.jung.algorithms.shortestpath.TestShortestPath
-
- extract(ArchetypeGraph) - Method in class edu.uci.ics.jung.algorithms.cluster.BicomponentClusterer
-
Extracts the bicomponents from the graph
- extract(ArchetypeGraph) - Method in class edu.uci.ics.jung.algorithms.cluster.EdgeBetweennessClusterer
-
Finds the set of clusters which have the strongest "community structure".
- extract(DirectedGraph, Set) - Method in class edu.uci.ics.jung.algorithms.cluster.ExactFlowCommunity
-
Extracts the community according to the cohesion threshold
- extract(DirectedGraph, Set, int) - Static method in class edu.uci.ics.jung.algorithms.cluster.ExactFlowCommunity
-
Implements the "ApproximateFlowCommunity" algorithm.
- extract(ArchetypeGraph) - Method in interface edu.uci.ics.jung.algorithms.cluster.GraphClusterer
-
Extracts the clusters from a graph.
- extract(ArchetypeGraph) - Method in class edu.uci.ics.jung.algorithms.cluster.WeakComponentClusterer
-
Extracts the weak components from a graph.
- extractInDirectedNeighborhood(DirectedGraph, Set, int) - Static method in class edu.uci.ics.jung.algorithms.connectivity.KNeighborhoodExtractor
-
Extracts the subgraph comprised of all vertices within distance K (in-directed) from any
node in rootNodes.
- extractNeighborhood(Graph, Set, int) - Static method in class edu.uci.ics.jung.algorithms.connectivity.KNeighborhoodExtractor
-
Extracts the subgraph comprised of all vertices within distance K (undirected) from any
node in rootNodes.
- extractOutDirectedNeighborhood(DirectedGraph, Set, int) - Static method in class edu.uci.ics.jung.algorithms.connectivity.KNeighborhoodExtractor
-
Extracts the subgraph comprised of all vertices within distance K (out-directed) from any
node in rootNodes.