|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use NumberVertexValue | |
---|---|
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 |
Uses of NumberVertexValue in edu.uci.ics.jung.algorithms.importance |
---|
Fields in edu.uci.ics.jung.algorithms.importance declared as NumberVertexValue | |
---|---|
protected NumberVertexValue |
VoltageRanker.voltages
|
Constructors in edu.uci.ics.jung.algorithms.importance with parameters of type NumberVertexValue | |
---|---|
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 . |
Uses of NumberVertexValue in edu.uci.ics.jung.graph.decorators |
---|
Classes in edu.uci.ics.jung.graph.decorators that implement NumberVertexValue | |
---|---|
class |
MapNumberVertexValue
A simple implementation of NumberVertexValue backed by a
Map . |
class |
UserDatumNumberVertexValue
|
Fields in edu.uci.ics.jung.graph.decorators declared as NumberVertexValue | |
---|---|
protected NumberVertexValue |
InterpolatingVertexSizeFunction.nvv
|
protected NumberVertexValue |
NumberVertexValueStringer.nvv
|
Methods in edu.uci.ics.jung.graph.decorators with parameters of type NumberVertexValue | |
---|---|
void |
InterpolatingVertexSizeFunction.setNumberVertexValue(NumberVertexValue nvv)
|
Constructors in edu.uci.ics.jung.graph.decorators with parameters of type NumberVertexValue | |
---|---|
InterpolatingVertexSizeFunction(NumberVertexValue nvv,
int min_size,
int max_size)
|
|
NumberVertexValueStringer(NumberVertexValue nev)
|
Uses of NumberVertexValue in edu.uci.ics.jung.utils |
---|
Methods in edu.uci.ics.jung.utils with parameters of type NumberVertexValue | |
---|---|
static void |
GraphUtils.copyValues(ArchetypeGraph g,
NumberVertexValue source,
NumberVertexValue dest)
Copies, for each vertex v in g ,
source 's value to dest . |
Uses of NumberVertexValue in samples.graph |
---|
Fields in samples.graph declared as NumberVertexValue | |
---|---|
protected NumberVertexValue |
PluggableRendererDemo.transparency
|
protected NumberVertexValue |
PluggableRendererDemo.voltages
|
Uses of NumberVertexValue in scratch.joshua.ranking |
---|
Fields in scratch.joshua.ranking declared as NumberVertexValue | |
---|---|
protected NumberVertexValue |
AbstractIterativeRanker.priors
|
Methods in scratch.joshua.ranking that return NumberVertexValue | |
---|---|
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. |
Methods in scratch.joshua.ranking with parameters of type NumberVertexValue | |
---|---|
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)
|
Constructors in scratch.joshua.ranking with parameters of type NumberVertexValue | |
---|---|
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)
|
Uses of NumberVertexValue in test.edu.uci.ics.jung.algorithms.importance |
---|
Classes in test.edu.uci.ics.jung.algorithms.importance that implement NumberVertexValue | |
---|---|
protected static class |
VoltageRankerTest.VertexVoltages
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |