- WattsBetaSmallWorldGenerator - Class in edu.uci.ics.jung.random.generators
-
WattsBetaSmallWorldGenerator is a graph generator that produces a small
world network using the beta-model as proposed by Duncan Watts.
- WattsBetaSmallWorldGenerator(int, double, int) - Constructor for class edu.uci.ics.jung.random.generators.WattsBetaSmallWorldGenerator
-
Constructs the small world graph generator.
- WeakComponentClusterer - Class in edu.uci.ics.jung.algorithms.cluster
-
Finds all weak components in a graph where a weak component is defined as
a maximal subgraph in which all pairs of vertices in the subgraph are reachable from one
another in the underlying undirected subgraph.
- WeakComponentClusterer() - Constructor for class edu.uci.ics.jung.algorithms.cluster.WeakComponentClusterer
-
- WEIGHT_DEFAULT_KEY - Static variable in class edu.uci.ics.jung.graph.decorators.EdgeWeightLabeller
-
The UserData key that stores edge weights.
- WEIGHTED_NIPATHS_KEY - Static variable in class edu.uci.ics.jung.algorithms.importance.WeightedNIPaths
-
- WeightedDegreeRanker - Class in scratch.joshua.ranking
-
- WeightedDegreeRanker(Graph, NumberEdgeValue, boolean) - Constructor for class scratch.joshua.ranking.WeightedDegreeRanker
-
- WeightedDegreeRanker(Graph, NumberEdgeValue) - Constructor for class scratch.joshua.ranking.WeightedDegreeRanker
-
- WeightedDegreeRanker(Graph) - Constructor for class scratch.joshua.ranking.WeightedDegreeRanker
-
- WeightedDegreeRanker(Graph, boolean) - Constructor for class scratch.joshua.ranking.WeightedDegreeRanker
-
- WeightedEdgeGraphFilter - Class in edu.uci.ics.jung.graph.filters.impl
-
This simple filter accepts Edges if their EdgeWeightLabeller turns out
to be greater than the input value.
- WeightedEdgeGraphFilter(int, EdgeWeightLabeller) - Constructor for class edu.uci.ics.jung.graph.filters.impl.WeightedEdgeGraphFilter
-
- WeightedNIPaths - Class in edu.uci.ics.jung.algorithms.importance
-
This algorithm measures the importance of nodes based upon both the number and length of disjoint paths that lead
to a given node from each of the nodes in the root set.
- WeightedNIPaths(DirectedGraph, double, int, Set) - Constructor for class edu.uci.ics.jung.algorithms.importance.WeightedNIPaths
-
Constructs and initializes the algorithm.
- weights - Variable in class scratch.joshua.ranking.PageRankRanker.SourceNormalizedEdgeValue
-
- WeirdFailure - Class in scratch.danyel
-
- WeirdFailure() - Constructor for class scratch.danyel.WeirdFailure
-
- WrappedIterableLayout - Class in samples.preview_new_graphdraw.iterablelayouts
-
This class runs one iterable layout until it is finished, then
starts on another (for either K iterations or until finished).
- WrappedIterableLayout(IterableLayout, IterableLayout) - Constructor for class samples.preview_new_graphdraw.iterablelayouts.WrappedIterableLayout
-
- WrappedIterableLayout(IterableLayout, IterableLayout, int) - Constructor for class samples.preview_new_graphdraw.iterablelayouts.WrappedIterableLayout
-
- writeJPEGImage(File) - Method in class samples.graph.GraphEditorDemo
-
copy the visible part of the graph to a file as a jpeg image