Uses of Class
edu.uci.ics.jung.algorithms.util.IterativeProcess
Packages that use IterativeProcess
Package
Description
Methods for calculating properties relating to network flows (such as max flow/min cut).
-
Uses of IterativeProcess in edu.uci.ics.jung.algorithms.flows
Subclasses of IterativeProcess in edu.uci.ics.jung.algorithms.flowsModifier and TypeClassDescriptionclass
EdmondsKarpMaxFlow<V,
E> Implements the Edmonds-Karp maximum flow algorithm for solving the maximum flow problem. -
Uses of IterativeProcess in edu.uci.ics.jung.algorithms.importance
Subclasses of IterativeProcess in edu.uci.ics.jung.algorithms.importanceModifier and TypeClassDescriptionclass
AbstractRanker<V,
E> Abstract class for algorithms that rank nodes or edges by some "importance" metric.class
Computes betweenness centrality for each vertex and edge in the graph.class
KStepMarkov<V,
E> Algorithm variant ofPageRankWithPriors
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.class
This class provides basic infrastructure for relative authority algorithms that compute the importance of nodes relative to one or more root nodes.class
WeightedNIPaths<V,
E> 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.