|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use NumberEdgeValue | |
---|---|
edu.uci.ics.jung.algorithms | Provides a set of specialized algorithms for computing various measures on graphs as well as transforming graphs in different ways. |
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.algorithms.metrics | |
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.algorithms.transformation | |
edu.uci.ics.jung.graph.decorators | Provides mechanisms for annotating nodes consistently with useful information. |
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.transform.shape | |
samples.graph | Provides sample graph code that may be of interest. |
scratch.joshua.ranking |
Uses of NumberEdgeValue in edu.uci.ics.jung.algorithms |
---|
Methods in edu.uci.ics.jung.algorithms with parameters of type NumberEdgeValue | |
---|---|
static SparseDoubleMatrix2D |
GraphMatrixOperations.graphToSparseMatrix(Graph g,
NumberEdgeValue nev)
Returns a SparseDoubleMatrix2D whose entries represent the edge weights for the edges in g , as specified by nev . |
static Graph |
GraphMatrixOperations.matrixToGraph(DoubleMatrix2D matrix,
NumberEdgeValue nev)
Creates a graph from a square (weighted) adjacency matrix. |
Uses of NumberEdgeValue in edu.uci.ics.jung.algorithms.importance |
---|
Fields in edu.uci.ics.jung.algorithms.importance declared as NumberEdgeValue | |
---|---|
protected NumberEdgeValue |
VoltageRanker.edge_weights
|
Constructors in edu.uci.ics.jung.algorithms.importance with parameters of type NumberEdgeValue | |
---|---|
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 . |
Uses of NumberEdgeValue in edu.uci.ics.jung.algorithms.metrics |
---|
Fields in edu.uci.ics.jung.algorithms.metrics declared as NumberEdgeValue | |
---|---|
protected NumberEdgeValue |
StructuralHoles.nev
|
Constructors in edu.uci.ics.jung.algorithms.metrics with parameters of type NumberEdgeValue | |
---|---|
StructuralHoles(NumberEdgeValue nev)
Creates a StructuralHoles instance based on the
edge weights specified by nev . |
Uses of NumberEdgeValue in edu.uci.ics.jung.algorithms.shortestpath |
---|
Fields in edu.uci.ics.jung.algorithms.shortestpath declared as NumberEdgeValue | |
---|---|
protected static NumberEdgeValue |
DijkstraDistance.dev
|
protected NumberEdgeValue |
DijkstraDistance.nev
|
Constructors in edu.uci.ics.jung.algorithms.shortestpath with parameters of type NumberEdgeValue | |
---|---|
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,
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 . |
Uses of NumberEdgeValue in edu.uci.ics.jung.algorithms.transformation |
---|
Methods in edu.uci.ics.jung.algorithms.transformation with parameters of type NumberEdgeValue | |
---|---|
protected void |
FoldingTransformer.addEdge(Graph newGraph,
Vertex firstEnd,
Element intermediate,
Vertex secondEnd,
NumberEdgeValue nev)
Creates a new edge from firstEnd to secondEnd
in newGraph . |
Graph |
FoldingTransformer.fold(Hypergraph h,
Graph target,
boolean use_vertices,
NumberEdgeValue nev,
BidiMap map)
Creates a Graph which is a "folded" version of h . |
Graph |
FoldingTransformer.fold(KPartiteGraph g,
Predicate p,
NumberEdgeValue nev)
Converts g into a unipartite graph whose vertex set is the
vertices whose partition is specified by p . |
Uses of NumberEdgeValue in edu.uci.ics.jung.graph.decorators |
---|
Classes in edu.uci.ics.jung.graph.decorators that implement NumberEdgeValue | |
---|---|
class |
ConstantDirectionalEdgeValue
Returns the constructor-specified value for each edge type. |
class |
ConstantEdgeValue
Returns a constructor-specified constant value for each edge. |
class |
EdgeWeightLabeller
A EdgeWeightLabeller applies a label to the edges of a Graph. |
class |
UserDatumNumberEdgeValue
An implementation of NumberEdgeValue that stores the values
in the UserData repository. |
Fields in edu.uci.ics.jung.graph.decorators declared as NumberEdgeValue | |
---|---|
protected NumberEdgeValue |
NumberEdgeValueStringer.nev
|
Constructors in edu.uci.ics.jung.graph.decorators with parameters of type NumberEdgeValue | |
---|---|
NumberEdgeValueStringer(NumberEdgeValue nev)
|
Uses of NumberEdgeValue in edu.uci.ics.jung.io |
---|
Methods in edu.uci.ics.jung.io with parameters of type NumberEdgeValue | |
---|---|
Graph |
PajekNetReader.load(Reader reader,
Graph g,
NumberEdgeValue nev)
Returns load(reader, g, nev, new TypedVertexGenerator(g)) . |
Graph |
PajekNetReader.load(Reader reader,
Graph g,
NumberEdgeValue nev,
VertexGenerator vg)
Populates the graph g with the graph represented by the
Pajek-format data supplied by reader . |
Graph |
PajekNetReader.load(Reader reader,
NumberEdgeValue nev)
Returns load(reader, new SparseGraph(), nev) . |
Graph |
PajekNetReader.load(String filename,
Graph g,
NumberEdgeValue nev)
Creates a FileReader from filename , calls
load(reader, g, nev) , closes the reader, and returns
the resultant graph. |
Graph |
PajekNetReader.load(String filename,
NumberEdgeValue nev)
Returns load(filename, new SparseGraph(), nev) . |
void |
PajekNetWriter.save(Graph g,
String filename,
VertexStringer vs,
NumberEdgeValue nev)
|
void |
PajekNetWriter.save(Graph g,
String filename,
VertexStringer vs,
NumberEdgeValue nev,
VertexLocationFunction vld)
Saves g to filename . |
void |
PajekNetWriter.save(Graph g,
Writer w,
VertexStringer vs,
NumberEdgeValue nev)
|
void |
PajekNetWriter.save(Graph graph,
Writer w,
VertexStringer vs,
NumberEdgeValue nev,
VertexLocationFunction vld)
Writes graph to w . |
Uses of NumberEdgeValue in edu.uci.ics.jung.utils |
---|
Methods in edu.uci.ics.jung.utils with parameters of type NumberEdgeValue | |
---|---|
static Graph |
TestGraphs.generateMixedRandomGraph(NumberEdgeValue edge_weight,
int num_vertices)
Equivalent to generateMixedRandomGraph(edge_weight, num_vertices, true) . |
static Graph |
TestGraphs.generateMixedRandomGraph(NumberEdgeValue edge_weights,
int num_vertices,
boolean parallel)
Returns a random mixed-mode graph. |
Uses of NumberEdgeValue in edu.uci.ics.jung.visualization |
---|
Fields in edu.uci.ics.jung.visualization declared as NumberEdgeValue | |
---|---|
protected NumberEdgeValue |
PluggableRenderer.edgeLabelClosenessFunction
|
Methods in edu.uci.ics.jung.visualization that return NumberEdgeValue | |
---|---|
NumberEdgeValue |
PluggableRenderer.getEdgeLabelClosenessFunction()
|
Methods in edu.uci.ics.jung.visualization with parameters of type NumberEdgeValue | |
---|---|
void |
PluggableRenderer.setEdgeLabelClosenessFunction(NumberEdgeValue nev)
Sets the NumberEdgeValue that specifies where to draw
the label for each edge. |
Uses of NumberEdgeValue in edu.uci.ics.jung.visualization.transform.shape |
---|
Methods in edu.uci.ics.jung.visualization.transform.shape that return NumberEdgeValue | |
---|---|
NumberEdgeValue |
PluggableRendererDecorator.getEdgeLabelClosenessFunction()
|
Methods in edu.uci.ics.jung.visualization.transform.shape with parameters of type NumberEdgeValue | |
---|---|
void |
PluggableRendererDecorator.setEdgeLabelClosenessFunction(NumberEdgeValue nev)
|
Uses of NumberEdgeValue in samples.graph |
---|
Fields in samples.graph declared as NumberEdgeValue | |
---|---|
protected NumberEdgeValue |
PluggableRendererDemo.edge_weight
|
Uses of NumberEdgeValue in scratch.joshua.ranking |
---|
Subinterfaces of NumberEdgeValue in scratch.joshua.ranking | |
---|---|
interface |
EdgeVertexNumberFunction
An interface for classes that can store and retrieve a value for an edge with respect to a specific incident vertex. |
Classes in scratch.joshua.ranking that implement NumberEdgeValue | |
---|---|
protected static class |
AbstractIterativeRanker.UniformIncident
|
protected static class |
AbstractIterativeRanker.UniformOut
|
static class |
PageRankRanker.SourceNormalizedEdgeValue
|
Fields in scratch.joshua.ranking declared as NumberEdgeValue | |
---|---|
protected NumberEdgeValue |
AbstractRanker.edge_value
|
protected static NumberEdgeValue |
AbstractIterativeRanker.UNIFORM_OUT
|
protected static NumberEdgeValue |
AbstractRanker.UNIT_VALUE
|
protected NumberEdgeValue |
PageRankRanker.SourceNormalizedEdgeValue.weights
|
Constructors in scratch.joshua.ranking with parameters of type NumberEdgeValue | |
---|---|
AbstractIterativeRanker(ArchetypeGraph g,
NumberEdgeValue edge_value,
int max_iterations,
double tolerance)
|
|
AbstractIterativeRanker(ArchetypeGraph g,
NumberVertexValue priors,
NumberEdgeValue edge_value,
int max_iterations,
double tolerance)
|
|
AbstractRanker(ArchetypeGraph g,
NumberEdgeValue nev)
|
|
EigenvectorCentralityRanker(Graph g,
NumberEdgeValue edge_value,
int max_iterations,
double tolerance)
|
|
EigenvectorCentralityRanker(Graph g,
NumberVertexValue priors,
NumberEdgeValue edge_value,
int max_iterations,
double tolerance)
|
|
HITSRanker(Graph g,
NumberEdgeValue edge_value,
int max_iterations,
double tolerance)
|
|
PageRankRanker.SourceNormalizedEdgeValue(NumberEdgeValue weights)
|
|
PageRankRanker(Graph g,
NumberEdgeValue edge_value,
int max_iterations,
double tolerance,
double alpha)
|
|
PageRankRanker(Graph g,
NumberVertexValue priors,
NumberEdgeValue edge_value,
int max_iterations,
double tolerance,
double alpha)
|
|
SingleValueRanker(ArchetypeGraph g,
NumberEdgeValue edge_value,
int max_iterations,
double tolerance)
|
|
SingleValueRanker(ArchetypeGraph g,
NumberVertexValue priors,
NumberEdgeValue edge_value,
int max_iterations,
double tolerance)
|
|
WeightedDegreeRanker(Graph g,
NumberEdgeValue edge_weights)
|
|
WeightedDegreeRanker(Graph g,
NumberEdgeValue edge_weights,
boolean normalized)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |