A B C D E F G H I K L M N O P R S T U V W X Y

W

WEIGHTED_NIPATHS_KEY - Static variable in class edu.uci.ics.jung.algorithms.importance.WeightedNIPaths

WattsBetaSmallWorldGenerator - class edu.uci.ics.jung.random.generators.WattsBetaSmallWorldGenerator.

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 edu.uci.ics.jung.algorithms.cluster.WeakComponentClusterer.

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

WeightedEdgeGraphFilter - class edu.uci.ics.jung.graph.filters.impl.WeightedEdgeGraphFilter.

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 edu.uci.ics.jung.algorithms.importance.WeightedNIPaths.

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.

wiggleRoomX() - Method in class edu.uci.ics.jung.visualization.AbstractRenderer

wiggleRoomY() - Method in class edu.uci.ics.jung.visualization.AbstractRenderer