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

K

KEY - Static variable in class edu.uci.ics.jung.algorithms.importance.DegreeDistributionRanker

KEY - Static variable in class edu.uci.ics.jung.algorithms.importance.PageRank

KKLayout - class edu.uci.ics.jung.visualization.contrib.KKLayout.

Implements the Kamada-Kawai algorithm for node layout.

KKLayout(Graph) - Constructor for class edu.uci.ics.jung.visualization.contrib.KKLayout

KKLayoutInt - class edu.uci.ics.jung.visualization.contrib.KKLayoutInt.

Implements the Kamada-Kawai algorithm for node layout, tweaked to store vertex distances as integers.

KKLayoutInt(Graph) - Constructor for class edu.uci.ics.jung.visualization.contrib.KKLayoutInt

KNeighborhoodExtractor - class edu.uci.ics.jung.algorithms.connectivity.KNeighborhoodExtractor.

Extracts the subgraph (neighborhood) from a graph whose nodes are no more than distance k away from at least one of the root nodes (starting vertices).

KNeighborhoodExtractor() - Constructor for class edu.uci.ics.jung.algorithms.connectivity.KNeighborhoodExtractor

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

A filter used to extract the k-neighborhood around one or more root node(s)

KNeighborhoodFilter(Set, int, int) - Constructor for class edu.uci.ics.jung.graph.filters.impl.KNeighborhoodFilter

Constructs a new instance of the filter

KNeighborhoodFilter(Vertex, int, int) - Constructor for class edu.uci.ics.jung.graph.filters.impl.KNeighborhoodFilter

Constructs a new instance of the filter

KPartiteEdgePredicate - class edu.uci.ics.jung.graph.predicates.KPartiteEdgePredicate.

An edge predicate that passes Edges whose endpoints satisfy distinct elements of the Predicate collection passed in as a parameter to the constructor.

KPartiteEdgePredicate(Collection) - Constructor for class edu.uci.ics.jung.graph.predicates.KPartiteEdgePredicate

KPartiteFolder - class edu.uci.ics.jung.algorithms.transformation.KPartiteFolder.

KPartiteFolder(boolean) - Constructor for class edu.uci.ics.jung.algorithms.transformation.KPartiteFolder

Creates an instance of this Folder.

KPartiteGraph - interface edu.uci.ics.jung.graph.KPartiteGraph.

An interface for k-partite graphs.

KPartiteSparseGraph - class edu.uci.ics.jung.graph.impl.KPartiteSparseGraph.

An implementation of KPartiteGraph based on SparseGraph.

KPartiteSparseGraph(Collection, boolean) - Constructor for class edu.uci.ics.jung.graph.impl.KPartiteSparseGraph

Creates a KPartiteSparseGraph whose partitions are specified by the predicates in the partitions array.

KPartiteSparseGraph(Graph, Collection, boolean) - Constructor for class edu.uci.ics.jung.graph.impl.KPartiteSparseGraph

Creates a new KPartiteSparseGraph which contains all the vertices and edges in g.

KStepMarkov - class edu.uci.ics.jung.algorithms.importance.KStepMarkov.

Algorithm variant of PageRankWithPriors that computes the importance of a node based upon taking fixed-length random walks out from the root set and then computing the stationary probability of being at each node.

KStepMarkov(DirectedGraph, Set, int, String) - Constructor for class edu.uci.ics.jung.algorithms.importance.KStepMarkov

Construct the algorihm instance and initializes the algorithm.

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

Graph generator that produces a random graph with small world properties.

KleinbergSmallWorldGenerator(int, double) - Constructor for class edu.uci.ics.jung.random.generators.KleinbergSmallWorldGenerator

Constructs the small world graph generator.

kurtosis() - Method in class edu.uci.ics.jung.statistics.Histogram

Returns the kurtosis of the values accumulated in the histogram bins.

kurtosis() - Method in class edu.uci.ics.jung.statistics.StatisticalMoments

The kurtosis measures the sharpness of the distribution near the maximum.