Package | Description |
---|---|
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.random.generators |
Provides a series of methods for generating new graphs with various properties.
|
edu.uci.ics.jung.statistics |
Provides a set of statistical tools for analyzing graphs.
|
edu.uci.ics.jung.utils |
Provides a series of useful utility methods, and a number of custom helper classes designed specifically for this application.
|
scratch.joshua.ranking | |
scratch.scott | |
scratch.scott.event | |
scratch.scott.partition |
Modifier and Type | Method and Description |
---|---|
ArchetypeGraph |
ClusterSet.getUnderlyingGraph() |
Modifier and Type | Method and Description |
---|---|
void |
VoltageClusterer.clear(ArchetypeGraph g)
Clears the voltage decoration values from the vertices of
g . |
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.cluster(ArchetypeGraph g,
int num_clusters)
Clusters the vertices of
g into
num_clusters clusters, based on their connectivity. |
ClusterSet |
BicomponentClusterer.extract(ArchetypeGraph theGraph)
Extracts the bicomponents from the graph
|
ClusterSet |
EdgeBetweennessClusterer.extract(ArchetypeGraph g)
Finds the set of clusters which have the strongest "community structure".
|
ClusterSet |
GraphClusterer.extract(ArchetypeGraph graph)
Extracts the clusters from a graph.
|
ClusterSet |
WeakComponentClusterer.extract(ArchetypeGraph aGraph)
Extracts the weak components from a graph.
|
Constructor and Description |
---|
ClusterSet(ArchetypeGraph underlyingGraph)
Creates a new instance.
|
VertexClusterSet(ArchetypeGraph underlyingGraph)
Constructs and initializes the set
|
Modifier and Type | Field and Description |
---|---|
protected ArchetypeGraph |
DijkstraDistance.g |
Constructor and Description |
---|
DijkstraDistance(ArchetypeGraph g)
Creates an instance of
DijkstraShortestPath for
the specified unweighted graph (that is, all weights 1) which
caches results locally. |
DijkstraDistance(ArchetypeGraph g,
boolean cached)
Creates an instance of
DijkstraShortestPath for
the specified unweighted graph (that is, all weights 1) which
caches results locally. |
DijkstraDistance(ArchetypeGraph g,
NumberEdgeValue nev)
Creates an instance of
DijkstraShortestPath for
the specified graph and the specified method of extracting weights
from edges, which caches results locally. |
DijkstraDistance(ArchetypeGraph g,
NumberEdgeValue nev,
boolean cached)
Creates an instance of
DijkstraShortestPath for
the specified graph and the specified method of extracting weights
from edges, which caches results locally if and only if
cached is true . |
DijkstraShortestPath(ArchetypeGraph g)
Creates an instance of
DijkstraShortestPath for
the specified unweighted graph (that is, all weights 1) which
caches results locally. |
DijkstraShortestPath(ArchetypeGraph g,
boolean cached)
Creates an instance of
DijkstraShortestPath for
the specified unweighted graph (that is, all weights 1) which
caches results locally. |
DijkstraShortestPath(ArchetypeGraph g,
NumberEdgeValue nev)
Creates an instance of
DijkstraShortestPath for
the specified graph and the specified method of extracting weights
from edges, which caches results locally. |
DijkstraShortestPath(ArchetypeGraph g,
NumberEdgeValue nev,
boolean cached)
Creates an instance of
DijkstraShortestPath for
the specified graph and the specified method of extracting weights
from edges, which caches results locally if and only if
cached is true . |
Modifier and Type | Interface and Description |
---|---|
interface |
DirectedGraph
A tagging interface for implementations of
Graph
whose edge set consists of implementations of DirectedEdge . |
interface |
Graph
A specific type of
ArchetypeGraph which consists of
a Vertex set and an Edge set. |
interface |
Hypergraph
A Hypergraph consists of hypervertices and hyperedges.
|
interface |
KPartiteGraph
An interface for k-partite graphs.
|
interface |
UndirectedGraph
A tagging interface for implementations of
Graph
whose edge set consists of implementations of UndirectedEdge . |
Modifier and Type | Method and Description |
---|---|
ArchetypeGraph |
ArchetypeGraph.copy()
Performs a deep copy of the graph and its contents.
|
ArchetypeGraph |
Element.getGraph()
Returns a reference to the graph that contains this element.
|
ArchetypeGraph |
ArchetypeGraph.newInstance()
Returns a graph of the same type as the graph on which this
method is invoked.
|
Modifier and Type | Method and Description |
---|---|
ArchetypeEdge |
ArchetypeEdge.copy(ArchetypeGraph g)
Creates a copy of this edge in graph
g . |
ArchetypeVertex |
ArchetypeVertex.copy(ArchetypeGraph g)
Creates a copy of this vertex in graph
g . |
ArchetypeEdge |
ArchetypeEdge.getEqualEdge(ArchetypeGraph g)
Returns the edge in graph
g , if any,
that is equivalent to this edge. |
ArchetypeVertex |
ArchetypeVertex.getEqualVertex(ArchetypeGraph g)
Returns the vertex in graph
g , if any, that is
equal to this vertex. |
ArchetypeEdge |
ArchetypeEdge.getEquivalentEdge(ArchetypeGraph g)
Deprecated.
As of version 1.4, renamed to getEqualEdge(g).
|
ArchetypeVertex |
ArchetypeVertex.getEquivalentVertex(ArchetypeGraph g)
Deprecated.
As of version 1.4, renamed to getEqualVertex(g).
|
Modifier and Type | Method and Description |
---|---|
void |
UserDatumNumberEdgeValue.clear(ArchetypeGraph g)
Removes this decoration from
g . |
void |
UserDatumNumberVertexValue.clear(ArchetypeGraph g)
Removes this decoration from
g . |
static Indexer |
Indexer.getAndUpdateIndexer(ArchetypeGraph g)
Gets the indexer associated with this graph.
|
static Indexer |
Indexer.getAndUpdateIndexer(ArchetypeGraph g,
java.lang.Object key)
Gets the indexer associated with this graph.
|
static Indexer |
Indexer.getIndexer(ArchetypeGraph g)
Gets the indexer associated with this graph.
|
static Indexer |
Indexer.getIndexer(ArchetypeGraph g,
java.lang.Object key)
* Gets an indexer associated with this graph at this key
|
static boolean |
Indexer.hasIndexer(ArchetypeGraph g)
Checks if there is an indexer assocated with this graph.
|
static boolean |
Indexer.hasIndexer(ArchetypeGraph g,
java.lang.Object key)
Checks if there is an indexer assocated with this graph.
|
static Indexer |
Indexer.newIndexer(ArchetypeGraph g,
int offset)
Creates a new indexer associated with this graph.
|
Modifier and Type | Method and Description |
---|---|
ArchetypeGraph |
GraphEvent.getGraph() |
Constructor and Description |
---|
GraphEvent(ArchetypeGraph g,
Element graphElement) |
GraphListenerHandler(ArchetypeGraph graph) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractArchetypeGraph |
class |
AbstractSparseGraph
This class provides a skeletal implementation of the
Graph
interface to minimize the effort required to implement this interface. |
class |
BipartiteGraph
A Bipartite graph is divided into A vertices and B vertices.
|
class |
DirectedSparseGraph
An implementation of
Graph that consists of a
Vertex set and a DirectedEdge set. |
class |
HypergraphBPG
Deprecated.
As of version 1.7, replaced by
SetHypergraph . |
class |
KPartiteSparseGraph
An implementation of KPartiteGraph based on SparseGraph.
|
class |
SetHypergraph
A basic implementation of
Hypergraph . |
class |
SparseGraph
An implementation of
AbstractSparseGraph that, by default, imposes no
constraints on the edges and vertices that may be added to it. |
class |
SparseTree
An implementation of
Graph that consists of a
Vertex set and a DirectedEdge set. |
class |
UndirectedSparseGraph
An implementation of
Graph that consists of a
Vertex set and an UndirectedEdge set. |
Modifier and Type | Method and Description |
---|---|
ArchetypeGraph |
AbstractArchetypeGraph.copy()
Creates a replica of this graph.
|
ArchetypeGraph |
HypergraphBPG.copy()
Deprecated.
|
ArchetypeGraph |
AbstractElement.getGraph() |
ArchetypeGraph |
AbstractHyperUnitBPG.getGraph()
Deprecated.
|
ArchetypeGraph |
AbstractArchetypeGraph.newInstance()
Creates a new empty graph of the same type as this graph, by cloning this
graph and then clearing the extraneous fields.
|
ArchetypeGraph |
HypergraphBPG.newInstance()
Deprecated.
|
Modifier and Type | Method and Description |
---|---|
ArchetypeEdge |
AbstractArchetypeEdge.copy(ArchetypeGraph g) |
ArchetypeVertex |
AbstractArchetypeVertex.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. |
ArchetypeVertex |
AbstractHypervertex.copy(ArchetypeGraph g) |
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. |
ArchetypeVertex |
AbstractSparseVertex.copy(ArchetypeGraph newGraph) |
ArchetypeEdge |
BipartiteEdge.copy(ArchetypeGraph newGraph) |
ArchetypeVertex |
BipartiteVertex.copy(ArchetypeGraph newGraph)
Specialized copy function for copy FROM BipartiteGraph TO BipartiteGraph
|
ArchetypeEdge |
HyperedgeBPG.copy(ArchetypeGraph g)
Deprecated.
|
ArchetypeVertex |
HypervertexBPG.copy(ArchetypeGraph g) |
ArchetypeEdge |
AbstractArchetypeEdge.getEqualEdge(ArchetypeGraph ag) |
ArchetypeEdge |
HyperedgeBPG.getEqualEdge(ArchetypeGraph g)
Deprecated.
|
ArchetypeVertex |
AbstractArchetypeVertex.getEqualVertex(ArchetypeGraph ag)
Returns the vertex in the specified graph
ag
that is equivalent to this vertex. |
ArchetypeVertex |
HypervertexBPG.getEqualVertex(ArchetypeGraph g) |
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).
|
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).
|
Modifier and Type | Method and Description |
---|---|
boolean |
CliqueGraphPredicate.evaluateGraph(ArchetypeGraph g) |
boolean |
ConnectedGraphPredicate.evaluateGraph(ArchetypeGraph graph)
Returns
true if there exists a path from each
vertex to all other vertices (ignoring edge direction). |
abstract boolean |
GraphPredicate.evaluateGraph(ArchetypeGraph g) |
Constructor and Description |
---|
NotInGraphEdgePredicate(ArchetypeGraph ag) |
NotInGraphVertexPredicate(ArchetypeGraph ag) |
Modifier and Type | Method and Description |
---|---|
ArchetypeGraph |
BarabasiAlbertGenerator.generateGraph() |
ArchetypeGraph |
EppsteinPowerLawGenerator.generateGraph()
Generates a graph whose degree distribution approximates a power-law.
|
ArchetypeGraph |
ErdosRenyiGenerator.generateGraph()
Returns a graph in which each pair of vertices is connected by
an undirected edge with the probability specified by the constructor.
|
ArchetypeGraph |
EvolvingGraphGenerator.generateGraph()
Returns a copy of the evolved graph in its current state
|
ArchetypeGraph |
GraphGenerator.generateGraph()
Instructs the algorithm to generate the graph
|
ArchetypeGraph |
KleinbergSmallWorldGenerator.generateGraph()
Generates a random small world network according to the parameters given
|
ArchetypeGraph |
Lattice1DGenerator.generateGraph() |
ArchetypeGraph |
Lattice2DGenerator.generateGraph() |
ArchetypeGraph |
SimpleRandomGenerator.generateGraph()
Generated the graph by creating |V| vertics and then picking |E| random
edges
|
ArchetypeGraph |
WattsBetaSmallWorldGenerator.generateGraph()
Generates a beta-network from a 1-lattice according to the parameters given.
|
Modifier and Type | Method and Description |
---|---|
static java.util.Map |
GraphStatistics.averageDistances(ArchetypeGraph g)
For each vertex
v in g ,
calculates the average shortest path length from v
to all other vertices in g , ignoring edge weights. |
static java.util.Map |
GraphStatistics.averageDistances(ArchetypeGraph graph,
Distance d)
For each vertex
v in graph ,
calculates the average shortest path length from v
to all other vertices in graph using the metric
specified by d , and returns the results in a
Map from vertices to Double values. |
static java.util.Map |
GraphStatistics.clusteringCoefficients(ArchetypeGraph graph)
Returns a
Map of vertices to their clustering coefficients. |
static double |
GraphStatistics.diameter(ArchetypeGraph g)
Returns the diameter of
g , ignoring edge weights. |
static double |
GraphStatistics.diameter(ArchetypeGraph g,
Distance d)
Returns the diameter of
g using the metric
specified by d . |
static double |
GraphStatistics.diameter(ArchetypeGraph g,
Distance d,
boolean use_max)
Returns the diameter of
g using the metric
specified by d . |
Modifier and Type | Field and Description |
---|---|
protected ArchetypeGraph |
AbstractVertexMapper.dest |
protected ArchetypeGraph |
SubsetManager.g
The graph for which this instance manages subsets.
|
Modifier and Type | Method and Description |
---|---|
static ArchetypeGraph |
GraphUtils.union(ArchetypeGraph g1,
ArchetypeGraph g2)
Returns a graph which consists of the union of the two input graphs.
|
Modifier and Type | Method and Description |
---|---|
static boolean |
PredicateUtils.addEdgeSubset(ArchetypeGraph g,
org.apache.commons.collections.Predicate p)
Creates an edge subset for
g based on p , which will
be maintained by the g 's SubsetManager . |
static boolean |
PredicateUtils.addVertexSubset(ArchetypeGraph g,
org.apache.commons.collections.Predicate p)
Creates a vertex subset for
g based on p , which will
be maintained by the g 's SubsetManager . |
static boolean |
GraphUtils.areEquivalent(ArchetypeGraph g1,
ArchetypeGraph g2)
Returns true if
g1 and g2 have equivalent
vertex and edge sets (that is, if each vertex and edge in g1
has an equivalent in g2 , and vice versa), and false
otherwise. |
static void |
GraphUtils.copyValues(ArchetypeGraph g,
NumberVertexValue source,
NumberVertexValue dest)
Copies, for each vertex
v in g ,
source 's value to dest . |
static boolean |
PredicateUtils.enforcesEdgeConstraint(ArchetypeGraph g,
org.apache.commons.collections.Predicate p)
Returns
true if p is an edge
constraint of g , and false otherwise. |
static boolean |
PredicateUtils.enforcesVertexConstraint(ArchetypeGraph g,
org.apache.commons.collections.Predicate p)
Returns
true if p is an edge
constraint of g , and false otherwise. |
static java.util.Set |
PredicateUtils.getEdges(ArchetypeGraph g,
org.apache.commons.collections.Predicate p)
Returns a
Set consisting of all edges e
in graph g that satisfy predicate p ,
that is, those for which p.evaluate(e) returns true. |
static java.util.Set |
GraphUtils.getEqualEdges(java.util.Set s,
ArchetypeGraph g)
Returns the set of edges in
g which are equal
to the edges in g . |
static java.util.Set |
GraphUtils.getEqualVertices(java.util.Set s,
ArchetypeGraph g)
Returns the set of vertices in
g which are equal
to the vertices in g . |
static SubsetManager |
SubsetManager.getInstance(ArchetypeGraph g)
Gets this graph's
SubsetManager , creating it if necessary. |
static VertexGenerator |
GraphUtils.getVertexGenerator(ArchetypeGraph g)
Returns the
VertexGenerator , if any, stored in g 's
user data at the standardized location specified by the VG interface: VertexGenerator.TAG . |
static java.util.Set |
PredicateUtils.getVertices(ArchetypeGraph g,
org.apache.commons.collections.Predicate p)
Returns a
Set consisting of all vertices v
in graph g that satisfy predicate p ,
that is, those for which p.evaluate(v) returns true. |
static void |
PredicateUtils.removeEdgeSubset(ArchetypeGraph g,
org.apache.commons.collections.Predicate p)
Removes the edge subset based on
p from
g 's SubsetManager . |
static void |
PredicateUtils.removeVertexSubset(ArchetypeGraph g,
org.apache.commons.collections.Predicate p)
Removes the vertex subset based on
p from
g 's SubsetManager . |
static boolean |
PredicateUtils.satisfiesEdgeConstraint(ArchetypeGraph g,
org.apache.commons.collections.Predicate p)
Returns
true if each edge in g
satisfies p , and false otherwise. |
static boolean |
PredicateUtils.satisfiesVertexConstraint(ArchetypeGraph g,
org.apache.commons.collections.Predicate p)
Returns
true if each vertex in g
satisfies p , and false otherwise. |
static ArchetypeGraph |
GraphUtils.union(ArchetypeGraph g1,
ArchetypeGraph g2)
Returns a graph which consists of the union of the two input graphs.
|
Constructor and Description |
---|
AbstractVertexMapper(ArchetypeGraph dest) |
CopyVertexMapper(ArchetypeGraph dest) |
StringLabellerVertexMapper(ArchetypeGraph dest) |
SubsetManager(ArchetypeGraph g)
Creates a
SubsetManager , adds it to the specified
graph's user data repository, and adds itself as a listener to
the graph's vertex and edge addition and removal events, so that the
subsets' memberships can be maintained. |
TypedVertexGenerator(ArchetypeGraph g) |
Modifier and Type | Field and Description |
---|---|
protected ArchetypeGraph |
AbstractRanker.graph |
Modifier and Type | Method and Description |
---|---|
protected static NumberVertexValue |
AbstractIterativeRanker.getNormalizedInitialValues(ArchetypeGraph g)
Returns
NumberVertexValue with uniformly distributed values
such that their sum, over all vertices in g , is 1. |
protected static NumberVertexValue |
AbstractIterativeRanker.getNormalizedInitialValues(ArchetypeGraph graph,
boolean squared)
Returns
NumberVertexValue with uniformly distributed values
such that their sum (of their squares if squared is
true ) over all vertices in g is 1. |
Constructor and Description |
---|
AbstractIterativeRanker(ArchetypeGraph g,
int max_iterations,
double tolerance) |
AbstractIterativeRanker(ArchetypeGraph g,
NumberEdgeValue edge_value,
int max_iterations,
double tolerance) |
AbstractIterativeRanker(ArchetypeGraph g,
NumberVertexValue priors,
int max_iterations,
double tolerance) |
AbstractIterativeRanker(ArchetypeGraph g,
NumberVertexValue priors,
NumberEdgeValue edge_value,
int max_iterations,
double tolerance) |
AbstractRanker(ArchetypeGraph g) |
AbstractRanker(ArchetypeGraph g,
NumberEdgeValue nev) |
SingleValueRanker(ArchetypeGraph g,
int max_iterations,
double tolerance) |
SingleValueRanker(ArchetypeGraph g,
NumberEdgeValue edge_value,
int max_iterations,
double tolerance) |
SingleValueRanker(ArchetypeGraph g,
NumberVertexValue priors,
int max_iterations,
double tolerance) |
SingleValueRanker(ArchetypeGraph g,
NumberVertexValue priors,
NumberEdgeValue edge_value,
int max_iterations,
double tolerance) |
Modifier and Type | Method and Description |
---|---|
protected static int |
UserExample.largestComponentDiameter(ArchetypeGraph g) |
Modifier and Type | Method and Description |
---|---|
ArchetypeGraph |
GraphEvent.getGraph() |
Modifier and Type | Method and Description |
---|---|
abstract ArchetypeGraph |
AbstractPartitionClass.constructGraph() |
ArchetypeGraph |
EdgePartitionClass.constructGraph() |
ArchetypeGraph |
VertexPartitionClass.constructGraph() |
ArchetypeGraph |
AbstractPartition.getUnderlyingGraph() |
Modifier and Type | Method and Description |
---|---|
protected void |
AbstractPartition.initialize(ArchetypeGraph g) |
protected void |
EdgePartition.initialize(ArchetypeGraph g) |
protected void |
VertexPartition.initialize(ArchetypeGraph g) |
Constructor and Description |
---|
EdgePartition(ArchetypeGraph g) |
VertexPartition(ArchetypeGraph g) |
VertexPartition(ArchetypeGraph g,
int numClasses) |