Package | Description |
---|---|
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 |
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.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.graph |
Specifies the interfaces for and capabilities of the JUNG vertex, edge, and graph classes.
|
edu.uci.ics.jung.graph.decorators |
Provides mechanisms for annotating nodes consistently with useful information.
|
edu.uci.ics.jung.graph.event | |
edu.uci.ics.jung.graph.impl |
Implementations of the JUNG vertex, edge, and graph interfaces.
|
edu.uci.ics.jung.graph.predicates |
A
Predicate tests whether an Object satisfies a specific
implementation-defined property. |
edu.uci.ics.jung.io |
Provides a set of graph file format interpreters for loading graphs from disk.
|
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 |
Provides a visualization mechanism for drawing and rendering Graphs.
|
edu.uci.ics.jung.visualization.subLayout | |
edu.uci.ics.jung.visualization.transform.shape | |
samples.graph |
Provides sample graph code that may be of interest.
|
scratch.danyel.lazy | |
scratch.danyel.sample | |
scratch.joshua.ranking | |
scratch.scott | |
test.edu.uci.ics.jung.algorithms.importance |
Modifier and Type | Interface and Description |
---|---|
static interface |
GraphCollapser.CollapsedVertex
This interface represents a vertex that holds a set of objects in some other graph.
|
Modifier and Type | Class and Description |
---|---|
class |
BipartiteGraphCollapser.CollapsedBipartiteVertex |
static class |
GraphCollapser.CollapsedSparseVertex
A CollapsedSparseVertex extends CollapsedVertex.
|
Modifier and Type | Method and Description |
---|---|
protected java.util.Collection |
VoltageClusterer.cluster_internal(ArchetypeGraph g,
ArchetypeVertex origin,
int num_clusters)
Does the work of
getCommunity and cluster . |
java.util.Collection |
VoltageClusterer.getCommunity(ArchetypeVertex v)
Returns a community (cluster) centered around
v . |
Modifier and Type | Method and Description |
---|---|
void |
DijkstraDistance.SourceData.createRecord(ArchetypeVertex w,
ArchetypeEdge e,
double new_dist) |
void |
DijkstraShortestPath.SourcePathData.createRecord(ArchetypeVertex w,
ArchetypeEdge e,
double new_dist) |
java.lang.Number |
DijkstraDistance.getDistance(ArchetypeVertex source,
ArchetypeVertex target)
Returns the length of a shortest path from the source to the target vertex,
or null if the target is not reachable from the source.
|
java.lang.Number |
Distance.getDistance(ArchetypeVertex source,
ArchetypeVertex target)
Returns the distance from the
source vertex
to the target vertex. |
java.lang.Number |
UnweightedShortestPath.getDistance(ArchetypeVertex source,
ArchetypeVertex target) |
java.util.Map |
DijkstraDistance.getDistanceMap(ArchetypeVertex source)
Returns a
LinkedHashMap which maps each vertex
in the graph (including the source vertex)
to its distance from the source vertex. |
java.util.Map |
Distance.getDistanceMap(ArchetypeVertex source)
Returns a
Map which maps each vertex
in the graph (including the source vertex)
to its distance (represented as a Number)
from source . |
java.util.Map |
UnweightedShortestPath.getDistanceMap(ArchetypeVertex source) |
java.util.LinkedHashMap |
DijkstraDistance.getDistanceMap(ArchetypeVertex source,
int numDests)
Returns a
LinkedHashMap which maps each of the closest
numDist vertices to the source vertex
in the graph (including the source vertex)
to its distance from the source vertex. |
java.util.Map |
DijkstraDistance.getDistanceMap(ArchetypeVertex source,
java.util.Set targets) |
protected java.util.Set |
DijkstraDistance.getIncidentEdges(ArchetypeVertex v)
Returns the set of edges incident to
v that should be tested. |
protected DijkstraDistance.SourceData |
DijkstraDistance.getSourceData(ArchetypeVertex source) |
protected DijkstraDistance.SourceData |
DijkstraShortestPath.getSourceData(ArchetypeVertex source) |
void |
DijkstraDistance.reset(ArchetypeVertex source)
Clears all stored distances for the specified source vertex
source . |
protected java.util.LinkedHashMap |
DijkstraDistance.singleSourceShortestPath(ArchetypeVertex source,
java.util.Set targets,
int numDests)
Implements Dijkstra's single-source shortest-path algorithm for
weighted graphs.
|
void |
DijkstraDistance.SourceData.update(ArchetypeVertex dest,
ArchetypeEdge tentative_edge,
double new_dist) |
void |
DijkstraShortestPath.SourcePathData.update(ArchetypeVertex dest,
ArchetypeEdge tentative_edge,
double new_dist) |
Constructor and Description |
---|
DijkstraDistance.SourceData(ArchetypeVertex source) |
DijkstraShortestPath.SourcePathData(ArchetypeVertex source) |
Modifier and Type | Interface and Description |
---|---|
interface |
Hypervertex
An element of a Hypergraph that
connects to zero or more Hyperedges.
|
interface |
Vertex
A specific type of
ArchetypeVertex that can be connected
by instances of Edge . |
Modifier and Type | Method and Description |
---|---|
ArchetypeVertex |
ArchetypeVertex.copy(ArchetypeGraph g)
Creates a copy of this vertex in graph
g . |
ArchetypeVertex |
ArchetypeVertex.getEqualVertex(ArchetypeGraph g)
Returns the vertex in graph
g , if any, that is
equal to this vertex. |
ArchetypeVertex |
ArchetypeVertex.getEquivalentVertex(ArchetypeGraph g)
Deprecated.
As of version 1.4, renamed to getEqualVertex(g).
|
Modifier and Type | Method and Description |
---|---|
ArchetypeEdge |
ArchetypeVertex.findEdge(ArchetypeVertex v)
Returns an edge that connects this vertex to
v . |
java.util.Set |
ArchetypeVertex.findEdgeSet(ArchetypeVertex v)
Returns the set of all edges that connect this vertex
with the specified vertex
v . |
boolean |
ArchetypeEdge.isIncident(ArchetypeVertex v)
Returns
true if the specified vertex v
is incident to this edge, and false otherwise. |
boolean |
ArchetypeVertex.isNeighborOf(ArchetypeVertex v)
Returns
true if the specified vertex v and
this vertex are each incident
to one or more of the same edges, and false otherwise. |
Modifier and Type | Method and Description |
---|---|
ArchetypeVertex |
Indexer.getVertex(int i)
Gets the vertex associated with this index.
|
Modifier and Type | Method and Description |
---|---|
javax.swing.Icon |
ConstantVertexIconFunction.getIcon(ArchetypeVertex v) |
javax.swing.Icon |
DefaultVertexIconFunction.getIcon(ArchetypeVertex v)
Returns the
Icon associated with v . |
javax.swing.Icon |
PickableVertexIconFunction.getIcon(ArchetypeVertex v)
Returns the appropriate
Icon , depending on picked state. |
javax.swing.Icon |
VertexIconFunction.getIcon(ArchetypeVertex v) |
int |
Indexer.getIndex(ArchetypeVertex v)
Gets the index assocated with this vertex.
|
java.lang.String |
ConstantVertexStringer.getLabel(ArchetypeVertex v) |
java.lang.String |
GlobalStringLabeller.getLabel(ArchetypeVertex v)
Gets the String label associated with a particular Vertex.
|
java.lang.String |
NumberVertexValueStringer.getLabel(ArchetypeVertex v) |
java.lang.String |
StringLabeller.getLabel(ArchetypeVertex v)
Gets the String label associated with a particular Vertex.
|
java.lang.String |
ToStringLabeller.getLabel(ArchetypeVertex v)
Retunrs v.toString()
|
java.lang.String |
VertexStringer.getLabel(ArchetypeVertex v) |
java.lang.Number |
MapNumberVertexValue.getNumber(ArchetypeVertex v) |
java.lang.Number |
NumberVertexValue.getNumber(ArchetypeVertex v) |
java.lang.Number |
UserDatumNumberVertexValue.getNumber(ArchetypeVertex v) |
void |
MapNumberVertexValue.setNumber(ArchetypeVertex v,
java.lang.Number n) |
void |
NumberVertexValue.setNumber(ArchetypeVertex v,
java.lang.Number n) |
void |
UserDatumNumberVertexValue.setNumber(ArchetypeVertex v,
java.lang.Number n) |
Modifier and Type | Method and Description |
---|---|
void |
GraphListenerHandler.handleAdd(ArchetypeVertex v) |
void |
GraphListenerHandler.handleRemove(ArchetypeVertex v) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractArchetypeVertex |
class |
AbstractHypervertex
This class provides a skeletal implementation of the
Hypervertex
interface to minimize the effort required to implement this interface. |
class |
AbstractSparseVertex
This class provides a skeletal implementation of the
Vertex
interface to minimize the effort required to implement this interface. |
class |
BipartiteVertex
created Dec 28, 2003
|
class |
CollectionHypervertex |
class |
DirectedSparseVertex
A vertex class that supports directed edges (but not
undirected edges) and allows parallel edges.
|
class |
HypervertexBPG
A Hypervertex has zero or more hyperEdges attached to it, and
is a member of a Hypergraph.
|
class |
LeanSparseVertex
This fully functional class is provided as a different sort of way to think about the creation
and use of Vertices, and a reminder that the user is always welcome to create
their own vertices.
|
class |
ListHypervertex
An implementation of
Hypervertex that stores its
incident edges as a List internally. |
class |
SetHypervertex
An implementation of
Hypervertex that maintains
independent Set s of incident edges and neighbors. |
class |
SimpleDirectedSparseVertex
An implementation of
Vertex that resides in a
directed graph; none of its adjoining edges may be parallel. |
class |
SimpleSparseVertex
An implementation of
Vertex that resides in a
sparse graph which may contain both directed and undirected edges. |
class |
SimpleUndirectedSparseVertex
An implementation of
Vertex that resides in a
undirected graph; none of its adjoining edges may be parallel. |
class |
SparseVertex
An implementation of
Vertex that resides in a
sparse graph which may contain directed and/or undirected edges,
as well as parallel edges. |
class |
UndirectedSparseVertex
A vertex class for instances of
UndirectedGraph
that may contain parallel edges. |
Modifier and Type | Method and Description |
---|---|
ArchetypeVertex |
AbstractArchetypeVertex.copy(ArchetypeGraph g) |
ArchetypeVertex |
AbstractHypervertex.copy(ArchetypeGraph g) |
ArchetypeVertex |
AbstractSparseVertex.copy(ArchetypeGraph newGraph) |
ArchetypeVertex |
BipartiteVertex.copy(ArchetypeGraph newGraph)
Specialized copy function for copy FROM BipartiteGraph TO BipartiteGraph
|
ArchetypeVertex |
HypervertexBPG.copy(ArchetypeGraph g) |
ArchetypeVertex |
AbstractArchetypeVertex.getEqualVertex(ArchetypeGraph ag)
Returns the vertex in the specified graph
ag
that is equivalent to this vertex. |
ArchetypeVertex |
HypervertexBPG.getEqualVertex(ArchetypeGraph g) |
ArchetypeVertex |
AbstractArchetypeVertex.getEquivalentVertex(ArchetypeGraph ag)
Deprecated.
As of version 1.4, renamed to getEqualVertex(ag).
|
ArchetypeVertex |
HypervertexBPG.getEquivalentVertex(ArchetypeGraph g)
Deprecated.
As of version 1.4, renamed to getEqualVertex(g).
|
ArchetypeVertex |
HypergraphBPG.getVertexCorrespondingTo(BipartiteVertex vertex2)
Deprecated.
|
Modifier and Type | Method and Description |
---|---|
ArchetypeEdge |
AbstractArchetypeVertex.findEdge(ArchetypeVertex v) |
ArchetypeEdge |
AbstractSparseVertex.findEdge(ArchetypeVertex v) |
ArchetypeEdge |
HypervertexBPG.findEdge(ArchetypeVertex v) |
java.util.Set |
AbstractArchetypeVertex.findEdgeSet(ArchetypeVertex v) |
java.util.Set |
AbstractSparseVertex.findEdgeSet(ArchetypeVertex v) |
java.util.Set |
HypervertexBPG.findEdgeSet(ArchetypeVertex v) |
boolean |
AbstractArchetypeEdge.isIncident(ArchetypeVertex v) |
boolean |
AbstractSparseEdge.isIncident(ArchetypeVertex v) |
boolean |
HyperedgeBPG.isIncident(ArchetypeVertex v)
Deprecated.
|
boolean |
AbstractArchetypeVertex.isNeighborOf(ArchetypeVertex v) |
boolean |
HypervertexBPG.isNeighborOf(ArchetypeVertex v)
Not a very efficient implementation
|
Modifier and Type | Method and Description |
---|---|
boolean |
ContainsUserDataKeyVertexPredicate.evaluateVertex(ArchetypeVertex v) |
boolean |
IsolatedVertexPredicate.evaluateVertex(ArchetypeVertex v)
Returns
true if the argument is a Vertex
whose degree is 0. |
boolean |
NotInGraphVertexPredicate.evaluateVertex(ArchetypeVertex av)
Returns
true if this vertex is not currently
a member of any graph. |
boolean |
SinkVertexPredicate.evaluateVertex(ArchetypeVertex arg0) |
boolean |
SourceVertexPredicate.evaluateVertex(ArchetypeVertex arg0) |
boolean |
UserDatumVertexPredicate.evaluateVertex(ArchetypeVertex v)
Returns
true if the datum stored by v with
key value key (in the user data repository) is
datum . |
abstract boolean |
VertexPredicate.evaluateVertex(ArchetypeVertex v) |
Modifier and Type | Method and Description |
---|---|
protected ArchetypeVertex |
GraphMLFileHandler.createVertex(java.util.Map attributeMap) |
Modifier and Type | Method and Description |
---|---|
ArchetypeVertex |
CopyVertexMapper.getMappedVertex(ArchetypeVertex v) |
ArchetypeVertex |
HashSettableVertexMapper.getMappedVertex(ArchetypeVertex v) |
ArchetypeVertex |
StringLabellerVertexMapper.getMappedVertex(ArchetypeVertex v)
see VertexMapper#getMappedVertex(edu.uci.ics.jung.graph.ArchetypeVertex)
|
ArchetypeVertex |
VertexMapper.getMappedVertex(ArchetypeVertex v) |
Modifier and Type | Method and Description |
---|---|
ArchetypeVertex |
CopyVertexMapper.getMappedVertex(ArchetypeVertex v) |
ArchetypeVertex |
HashSettableVertexMapper.getMappedVertex(ArchetypeVertex v) |
ArchetypeVertex |
StringLabellerVertexMapper.getMappedVertex(ArchetypeVertex v)
see VertexMapper#getMappedVertex(edu.uci.ics.jung.graph.ArchetypeVertex)
|
ArchetypeVertex |
VertexMapper.getMappedVertex(ArchetypeVertex v) |
void |
HashSettableVertexMapper.map(ArchetypeVertex v1,
ArchetypeVertex v2) |
void |
SettableVertexMapper.map(ArchetypeVertex v1,
ArchetypeVertex v2) |
Modifier and Type | Method and Description |
---|---|
Coordinates |
AbstractLayout.getCoordinates(ArchetypeVertex v)
Returns the Coordinates object that stores the vertex' x and y location.
|
java.awt.geom.Point2D |
AbstractLayout.getLocation(ArchetypeVertex v) |
java.awt.geom.Point2D |
DefaultSettableVertexLocationFunction.getLocation(ArchetypeVertex v) |
java.awt.geom.Point2D |
FadingVertexLayout.getLocation(ArchetypeVertex v)
Deprecated.
|
java.awt.geom.Point2D |
Layout.getLocation(ArchetypeVertex v) |
java.awt.geom.Point2D |
LayoutDecorator.getLocation(ArchetypeVertex v) |
java.awt.geom.Point2D |
RandomVertexLocationDecorator.getLocation(ArchetypeVertex v) |
java.awt.geom.Point2D |
VertexLocationFunction.getLocation(ArchetypeVertex v) |
protected boolean |
AbstractRenderer.isPicked(ArchetypeVertex v) |
boolean |
MultiPickedState.isPicked(ArchetypeVertex v) |
boolean |
PickedInfo.isPicked(ArchetypeVertex v) |
boolean |
PickedState.isPicked(ArchetypeVertex v)
Returns
true if v is currently "picked". |
boolean |
PluggableRenderer.isPicked(ArchetypeVertex v)
Deprecated.
Use an independent PickedInfo instead of this version,
which relies on the Renderer to supply an instance.
|
boolean |
MultiPickedState.pick(ArchetypeVertex v,
boolean picked) |
boolean |
PickedState.pick(ArchetypeVertex v,
boolean b)
Marks
v as "picked" if b == true ,
and unmarks v as picked if b == false . |
void |
DefaultSettableVertexLocationFunction.setLocation(ArchetypeVertex v,
java.awt.geom.Point2D location) |
void |
SettableVertexLocationFunction.setLocation(ArchetypeVertex v,
java.awt.geom.Point2D location) |
void |
PickEventListener.vertexPicked(ArchetypeVertex v)
Deprecated.
|
void |
PickEventListener.vertexUnpicked(ArchetypeVertex v)
Deprecated.
|
Modifier and Type | Method and Description |
---|---|
java.awt.geom.Point2D |
CircularSubLayout.getLocation(ArchetypeVertex v) |
java.awt.geom.Point2D |
SubLayout.getLocation(ArchetypeVertex v) |
java.awt.geom.Point2D |
SubLayoutDecorator.getLocation(ArchetypeVertex v) |
protected java.awt.geom.Point2D |
SubLayoutDecorator.getLocationInSubLayout(ArchetypeVertex v) |
Modifier and Type | Method and Description |
---|---|
boolean |
PluggableRendererDecorator.isPicked(ArchetypeVertex v) |
Modifier and Type | Method and Description |
---|---|
javax.swing.Icon |
VertexImageShaperDemo.DemoVertexImageShapeFunction.getIcon(ArchetypeVertex v) |
java.lang.String |
VertexImageShaperDemo.VertexStringerImpl.getLabel(ArchetypeVertex v) |
Modifier and Type | Class and Description |
---|---|
class |
LazySparseVertex |
Modifier and Type | Method and Description |
---|---|
java.awt.geom.Point2D |
CircleLayout.getLocation(ArchetypeVertex v) |
Modifier and Type | Method and Description |
---|---|
java.lang.Number |
AbstractIterativeRanker.UniformIncident.getNumber(ArchetypeEdge e,
ArchetypeVertex v) |
java.lang.Number |
EdgeVertexNumberFunction.getNumber(ArchetypeEdge e,
ArchetypeVertex v) |
protected boolean |
AbstractIterativeRanker.hasConverged(ArchetypeVertex v,
NumberVertexValue first,
NumberVertexValue second) |
void |
AbstractIterativeRanker.UniformIncident.setNumber(ArchetypeEdge e,
ArchetypeVertex v,
java.lang.Number n) |
void |
EdgeVertexNumberFunction.setNumber(ArchetypeEdge e,
ArchetypeVertex v,
java.lang.Number n) |
Modifier and Type | Method and Description |
---|---|
java.awt.geom.Point2D |
AestheticSpringVisualizer.getLocation(ArchetypeVertex v) |
Modifier and Type | Method and Description |
---|---|
java.lang.Number |
VoltageRankerTest.VertexVoltages.getNumber(ArchetypeVertex v) |
void |
VoltageRankerTest.VertexVoltages.setNumber(ArchetypeVertex v,
java.lang.Number n) |