Search Java Classes and Packages
#Edu.uci.ics.jung.algorithms.importance Classes and Interfaces - 9 results found.
| Name | Description | Type | Package | Framework |
| AbstractRanker | Abstract class for algorithms that rank nodes or edges by some "importance" metric. | Class | edu.uci.ics.jung.algorithms.importance | SourceForge Jung |
| BetweennessCentrality | Computes betweenness centrality for each vertex and edge in the graph. | Class | edu.uci.ics.jung.algorithms.importance | SourceForge Jung |
| 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. | Class | edu.uci.ics.jung.algorithms.importance | SourceForge Jung |
| MarkovCentrality | Class | edu.uci.ics.jung.algorithms.importance | SourceForge Jung | |
| RandomWalkBetweenness | Computes betweenness centrality for each vertex in the graph. | Class | edu.uci.ics.jung.algorithms.importance | SourceForge Jung |
| RandomWalkSTBetweenness | Computes s-t betweenness centrality for each vertex in the graph. | Class | edu.uci.ics.jung.algorithms.importance | SourceForge Jung |
| Ranking | Abstract data container for ranking objects. | Class | edu.uci.ics.jung.algorithms.importance | SourceForge Jung |
| RelativeAuthorityRanker | This class provides basic infrastructure for relative authority algorithms that compute the importance of nodes relative to one or more root nodes. | Class | edu.uci.ics.jung.algorithms.importance | SourceForge Jung |
| 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. | Class | edu.uci.ics.jung.algorithms.importance | SourceForge Jung |