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 TypeClassDescriptionclassEdmondsKarpMaxFlow<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 TypeClassDescriptionclassAbstractRanker<V,E> Abstract class for algorithms that rank nodes or edges by some "importance" metric.classComputes betweenness centrality for each vertex and edge in the graph.classKStepMarkov<V,E> Algorithm variant ofPageRankWithPriorsthat 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.classThis class provides basic infrastructure for relative authority algorithms that compute the importance of nodes relative to one or more root nodes.classWeightedNIPaths<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.