| 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.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.visualization |
Provides a visualization mechanism for drawing and rendering Graphs.
|
| edu.uci.ics.jung.visualization.transform.shape | |
| scratch.joshua.ranking |
| Modifier and Type | Interface and Description |
|---|---|
static interface |
GraphCollapser.CollapsedEdge
The CollapsedEdge interface represents a set of edges
in some other graph.
|
| Modifier and Type | Class and Description |
|---|---|
class |
BipartiteGraphCollapser.CollapsedBipartiteEdge |
static class |
GraphCollapser.DirectedCollapsedEdge
This class represents a Collapsed Directed edge,
and extends DirectedSparseEdge.
|
static class |
GraphCollapser.UndirectedCollapsedEdge
This class represents a Collapsed Undirected edge,
and extends UndirectedSparseEdge.
|
| 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) |
void |
DijkstraDistance.SourceData.update(ArchetypeVertex dest,
ArchetypeEdge tentative_edge,
double new_dist) |
void |
DijkstraShortestPath.SourcePathData.update(ArchetypeVertex dest,
ArchetypeEdge tentative_edge,
double new_dist) |
| Modifier and Type | Interface and Description |
|---|---|
interface |
DirectedEdge
A type of
Edge which imposes an ordering on its incident
vertices. |
interface |
Edge
A specific type of
ArchetypeEdge that connects exactly
two instances of Vertex. |
interface |
Hyperedge
An element of a Hypergraph that
connects to zero or more Hypervertices.
|
interface |
UndirectedEdge
A tagging interface for implementations of
Edge that do not
impose an ordering on their incident vertices. |
| Modifier and Type | Method and Description |
|---|---|
ArchetypeEdge |
ArchetypeEdge.copy(ArchetypeGraph g)
Creates a copy of this edge in graph
g. |
ArchetypeEdge |
ArchetypeVertex.findEdge(ArchetypeVertex v)
Returns an edge that connects this vertex to
v. |
ArchetypeEdge |
ArchetypeEdge.getEqualEdge(ArchetypeGraph g)
Returns the edge in graph
g, if any,
that is equivalent to this edge. |
ArchetypeEdge |
ArchetypeEdge.getEquivalentEdge(ArchetypeGraph g)
Deprecated.
As of version 1.4, renamed to getEqualEdge(g).
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
ArchetypeVertex.isIncident(ArchetypeEdge e)
Returns
true if the specified edge e is
incident to this vertex, and false otherwise. |
| Modifier and Type | Method and Description |
|---|---|
java.lang.String |
ConstantEdgeStringer.getLabel(ArchetypeEdge e) |
java.lang.String |
EdgeStringer.getLabel(ArchetypeEdge e) |
java.lang.String |
EdgeWeightLabellerStringer.getLabel(ArchetypeEdge e) |
java.lang.String |
NumberEdgeValueStringer.getLabel(ArchetypeEdge e) |
java.lang.Number |
ConstantDirectionalEdgeValue.getNumber(ArchetypeEdge e) |
java.lang.Number |
ConstantEdgeValue.getNumber(ArchetypeEdge arg0) |
java.lang.Number |
EdgeWeightLabeller.getNumber(ArchetypeEdge e) |
java.lang.Number |
NumberEdgeValue.getNumber(ArchetypeEdge e) |
java.lang.Number |
UserDatumNumberEdgeValue.getNumber(ArchetypeEdge e) |
int |
EdgeWeightLabeller.getWeight(ArchetypeEdge e)
Gets the weight of a particualr edge.
|
java.lang.Number |
EdgeWeightLabeller.removeWeight(ArchetypeEdge e)
Removes the weight stored by this decorator for the indicated edge
e,
and returns the value of this weight (or null if there was no
such weight for this edge). |
void |
ConstantDirectionalEdgeValue.setNumber(ArchetypeEdge e,
java.lang.Number n) |
void |
ConstantEdgeValue.setNumber(ArchetypeEdge arg0,
java.lang.Number arg1) |
void |
EdgeWeightLabeller.setNumber(ArchetypeEdge e,
java.lang.Number n) |
void |
NumberEdgeValue.setNumber(ArchetypeEdge e,
java.lang.Number n) |
void |
UserDatumNumberEdgeValue.setNumber(ArchetypeEdge e,
java.lang.Number n) |
void |
EdgeWeightLabeller.setWeight(ArchetypeEdge e,
int i)
Sets an edge to this weight.
|
| Modifier and Type | Method and Description |
|---|---|
void |
GraphListenerHandler.handleAdd(ArchetypeEdge e) |
void |
GraphListenerHandler.handleRemove(ArchetypeEdge e) |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractArchetypeEdge |
class |
AbstractHyperedge
This class provides a skeletal implementation of the
Hyperedge
interface to minimize the effort required to implement this interface. |
class |
AbstractSparseEdge
This class provides a skeletal implementation of the
Edge
interface to minimize the effort required to implement this interface. |
class |
BipartiteEdge
A simple extension of the UndirectedSparseEdge, except
with careful bounds checking.
|
class |
CollectionHyperedge
An implementation of
Hyperedge that stores its
collection of incident vertices internally as a Collection. |
class |
DirectedSparseEdge
An implementation of
DirectedEdge that resides in a
directed graph. |
class |
HyperedgeBPG
Deprecated.
As of version 1.7, replaced by native implementations of
Hyperedge. |
class |
ListHyperedge
An implementation of
Hyperedge that stores its
list of incident vertices internally as a List. |
class |
SetHyperedge
An implementation of
Hyperedge that stores its
collection of incident vertices internally as a Set. |
class |
UndirectedSparseEdge
An implementation of
UndirectedEdge that resides
in an undirected graph. |
| Modifier and Type | Method and Description |
|---|---|
ArchetypeEdge |
AbstractArchetypeEdge.copy(ArchetypeGraph g) |
ArchetypeEdge |
AbstractHyperedge.copy(ArchetypeGraph newGraph)
Creates a copy of this edge in the specified graph
newGraph,
and copies this edge's user data to the new edge. |
ArchetypeEdge |
AbstractSparseEdge.copy(ArchetypeGraph newGraph)
Creates a copy of this edge in the specified graph
newGraph,
and copies this edge's user data to the new edge. |
ArchetypeEdge |
BipartiteEdge.copy(ArchetypeGraph newGraph) |
ArchetypeEdge |
HyperedgeBPG.copy(ArchetypeGraph g)
Deprecated.
|
ArchetypeEdge |
AbstractArchetypeVertex.findEdge(ArchetypeVertex v) |
ArchetypeEdge |
AbstractSparseVertex.findEdge(ArchetypeVertex v) |
ArchetypeEdge |
HypervertexBPG.findEdge(ArchetypeVertex v) |
ArchetypeEdge |
HypergraphBPG.getEdgeCorrespondingTo(BipartiteVertex vertex2)
Deprecated.
|
ArchetypeEdge |
AbstractArchetypeEdge.getEqualEdge(ArchetypeGraph ag) |
ArchetypeEdge |
HyperedgeBPG.getEqualEdge(ArchetypeGraph g)
Deprecated.
|
ArchetypeEdge |
AbstractArchetypeEdge.getEquivalentEdge(ArchetypeGraph ag)
Deprecated.
As of version 1.4, renamed to getEqualEdge(ag).
|
ArchetypeEdge |
HyperedgeBPG.getEquivalentEdge(ArchetypeGraph g)
Deprecated.
As of version 1.4, renamed to getEqualEdge(g).
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
AbstractArchetypeVertex.isIncident(ArchetypeEdge e) |
boolean |
HypervertexBPG.isIncident(ArchetypeEdge e) |
| Modifier and Type | Method and Description |
|---|---|
abstract boolean |
EdgePredicate.evaluateEdge(ArchetypeEdge e) |
boolean |
KPartiteEdgePredicate.evaluateEdge(ArchetypeEdge edge) |
boolean |
NotInGraphEdgePredicate.evaluateEdge(ArchetypeEdge e)
Returns
true if this edge is not currently
part of graph ag. |
boolean |
ParallelEdgePredicate.evaluateEdge(ArchetypeEdge ae)
Returns
true if there exists an
edge which is parallel to the specified edge. |
boolean |
ReciprocatedDirectedEdgePredicate.evaluateEdge(ArchetypeEdge e) |
boolean |
SelfLoopEdgePredicate.evaluateEdge(ArchetypeEdge e)
Returns
true if e is an
Edge that connects a vertex to itself. |
boolean |
SimpleEdgePredicate.evaluateEdge(ArchetypeEdge ae)
Returns
true if ae is neither a
self-loop nor parallel to an existing edge. |
boolean |
TreePredicate.evaluateEdge(ArchetypeEdge e)
Any edges added to this graph must go to a vertex where
|
boolean |
UserDatumEdgePredicate.evaluateEdge(ArchetypeEdge e)
Returns
true if the datum stored by e with
key value key (in the user data repository) is
datum. |
| Modifier and Type | Method and Description |
|---|---|
void |
PickEventListener.edgePicked(ArchetypeEdge v)
Deprecated.
|
void |
PickEventListener.edgeUnpicked(ArchetypeEdge v)
Deprecated.
|
protected boolean |
AbstractRenderer.isPicked(ArchetypeEdge e) |
boolean |
MultiPickedState.isPicked(ArchetypeEdge e) |
boolean |
PickedInfo.isPicked(ArchetypeEdge e) |
boolean |
PickedState.isPicked(ArchetypeEdge e)
Returns
true if e is currently "picked". |
boolean |
PluggableRenderer.isPicked(ArchetypeEdge e)
Deprecated.
Use an independent PickedInfo instead of this version,
which relies on the Renderer to supply an instance.
|
boolean |
MultiPickedState.pick(ArchetypeEdge e,
boolean picked) |
boolean |
PickedState.pick(ArchetypeEdge e,
boolean b)
Marks
e as "picked" if b == true,
and unmarks e as picked if b == false. |
| Modifier and Type | Method and Description |
|---|---|
boolean |
PluggableRendererDecorator.isPicked(ArchetypeEdge e) |
| Modifier and Type | Method and Description |
|---|---|
java.lang.Number |
AbstractIterativeRanker.UniformOut.getNumber(ArchetypeEdge ae) |
java.lang.Number |
AbstractIterativeRanker.UniformIncident.getNumber(ArchetypeEdge ae) |
java.lang.Number |
PageRankRanker.SourceNormalizedEdgeValue.getNumber(ArchetypeEdge ae) |
java.lang.Number |
AbstractIterativeRanker.UniformIncident.getNumber(ArchetypeEdge e,
ArchetypeVertex v) |
java.lang.Number |
EdgeVertexNumberFunction.getNumber(ArchetypeEdge e,
ArchetypeVertex v) |
void |
AbstractIterativeRanker.UniformIncident.setNumber(ArchetypeEdge e,
ArchetypeVertex v,
java.lang.Number n) |
void |
EdgeVertexNumberFunction.setNumber(ArchetypeEdge e,
ArchetypeVertex v,
java.lang.Number n) |
void |
AbstractIterativeRanker.UniformOut.setNumber(ArchetypeEdge e,
java.lang.Number n) |
void |
AbstractIterativeRanker.UniformIncident.setNumber(ArchetypeEdge e,
java.lang.Number n) |
void |
PageRankRanker.SourceNormalizedEdgeValue.setNumber(ArchetypeEdge e,
java.lang.Number n) |