Package | Description |
---|---|
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.graph.decorators |
Provides mechanisms for annotating nodes consistently with useful information.
|
edu.uci.ics.jung.utils |
Provides a series of useful utility methods, and a number of custom helper classes designed specifically for this application.
|
samples.graph |
Provides sample graph code that may be of interest.
|
scratch.joshua.ranking | |
test.edu.uci.ics.jung.algorithms.importance |
Modifier and Type | Field and Description |
---|---|
protected NumberVertexValue |
VoltageRanker.voltages |
Constructor and Description |
---|
VoltageRanker(NumberEdgeValue edge_weights,
NumberVertexValue voltages,
int num_iterations,
double convergence_threshold)
Creates an instance of
VoltageRanker which uses the
edge weights specified by edge_weights , and which stores
the voltages (ranks) as specified by voltages . |
VoltageRanker(NumberVertexValue voltages,
int num_iterations,
double threshold)
Creates an instance of
VoltageRanker which treats the
edges as though they were unweighted, and which stores
the voltages (ranks) as specified by voltages . |
Modifier and Type | Class and Description |
---|---|
class |
MapNumberVertexValue
A simple implementation of
NumberVertexValue backed by a
Map . |
class |
UserDatumNumberVertexValue |
Modifier and Type | Field and Description |
---|---|
protected NumberVertexValue |
InterpolatingVertexSizeFunction.nvv |
protected NumberVertexValue |
NumberVertexValueStringer.nvv |
Modifier and Type | Method and Description |
---|---|
void |
InterpolatingVertexSizeFunction.setNumberVertexValue(NumberVertexValue nvv) |
Constructor and Description |
---|
InterpolatingVertexSizeFunction(NumberVertexValue nvv,
int min_size,
int max_size) |
NumberVertexValueStringer(NumberVertexValue nev) |
Modifier and Type | Method and Description |
---|---|
static void |
GraphUtils.copyValues(ArchetypeGraph g,
NumberVertexValue source,
NumberVertexValue dest)
Copies, for each vertex
v in g ,
source 's value to dest . |
Modifier and Type | Field and Description |
---|---|
protected NumberVertexValue |
PluggableRendererDemo.transparency |
protected NumberVertexValue |
PluggableRendererDemo.voltages |
Modifier and Type | Field and Description |
---|---|
protected NumberVertexValue |
AbstractIterativeRanker.priors |
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. |
Modifier and Type | Method and Description |
---|---|
void |
SingleValueRanker.advance(NumberVertexValue out) |
void |
HITSRanker.advance(NumberVertexValue auth_out,
NumberVertexValue hub_out) |
void |
PageRankRanker.advance(NumberVertexValue in,
NumberVertexValue out) |
abstract void |
SingleValueRanker.advance(NumberVertexValue in,
NumberVertexValue out) |
void |
HITSRanker.advance(NumberVertexValue auth_in,
NumberVertexValue hub_in,
NumberVertexValue auth_out,
NumberVertexValue hub_out) |
void |
SingleValueRanker.evaluate(NumberVertexValue out) |
void |
WeightedDegreeRanker.evaluate(NumberVertexValue degrees) |
void |
HITSRanker.evaluate(NumberVertexValue auth_out,
NumberVertexValue hub_out) |
void |
SingleValueRanker.evaluate(NumberVertexValue in,
NumberVertexValue out) |
void |
WeightedDegreeRanker.evaluate(NumberVertexValue in,
NumberVertexValue out) |
void |
HITSRanker.evaluate(NumberVertexValue auth_in,
NumberVertexValue hub_in,
NumberVertexValue auth_out,
NumberVertexValue hub_out)
Essentially, calls advance() until one of the termination conditions
is met (max iterations passed or all changes below tolerance).
|
void |
WeightedDegreeRanker.evaluateIncoming(NumberVertexValue in) |
void |
WeightedDegreeRanker.evaluateOutgoing(NumberVertexValue out) |
double |
AbstractIterativeRanker.getToleranceValue(double cur_tolerance,
NumberVertexValue old_value,
NumberVertexValue new_value)
Returns the maximum of largest single difference between any value in
old_value and the corresponding value in
new_value . |
protected boolean |
AbstractIterativeRanker.hasConverged(ArchetypeVertex v,
NumberVertexValue first,
NumberVertexValue second) |
protected void |
AbstractRanker.normalizeValues(NumberVertexValue nvv) |
protected void |
AbstractRanker.normalizeValues(NumberVertexValue nvv,
boolean squared) |
Constructor and Description |
---|
AbstractIterativeRanker(ArchetypeGraph g,
NumberVertexValue priors,
int max_iterations,
double tolerance) |
AbstractIterativeRanker(ArchetypeGraph g,
NumberVertexValue priors,
NumberEdgeValue edge_value,
int max_iterations,
double tolerance) |
EigenvectorCentralityRanker(Graph g,
NumberVertexValue priors,
NumberEdgeValue edge_value,
int max_iterations,
double tolerance) |
PageRankRanker(Graph g,
NumberVertexValue priors,
NumberEdgeValue edge_value,
int max_iterations,
double tolerance,
double alpha) |
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 | Class and Description |
---|---|
protected static class |
VoltageRankerTest.VertexVoltages |