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

P

PRIOR_KEY - Static variable in class edu.uci.ics.jung.algorithms.importance.RelativeAuthorityRanker

The default key used for the user datum key corresponding to prior rank scores.

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

This algorithm measures the importance of a node in terms of the fraction of time spent at that node relative to all other nodes.

PageRank(DirectedGraph, double) - Constructor for class edu.uci.ics.jung.algorithms.importance.PageRank

Basic constructor which initializes the algorithm

PageRank(DirectedGraph, double, String) - Constructor for class edu.uci.ics.jung.algorithms.importance.PageRank

Specialized constructor that allows the user to specify an edge key if edges already have user-defined weights assigned to them.

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

Algorithm that extends the PageRank algorithm by incorporating root nodes (priors).

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

Constructs an instance of the ranker.

Pair - class edu.uci.ics.jung.utils.Pair.

Stores a pair of values together.

Pair(Object, Object) - Constructor for class edu.uci.ics.jung.utils.Pair

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

A predicate that checks to see whether the specified edge is parallel to any other edge.

PickedInfo - interface edu.uci.ics.jung.visualization.PickedInfo.

PredicateUtils - class edu.uci.ics.jung.utils.PredicateUtils.

Convenience methods for handling Predicates in JUNG (as constraints, as subset specifications, and in general).

PredicateUtils() - Constructor for class edu.uci.ics.jung.utils.PredicateUtils

paintEdge(Graphics, Edge, int, int, int, int) - Method in class edu.uci.ics.jung.visualization.AbstractRenderer

paintEdge(Graphics, Edge, int, int, int, int) - Method in interface edu.uci.ics.jung.visualization.Renderer

paintEdge(Graphics, Edge, int, int, int, int) - Method in class edu.uci.ics.jung.visualization.graphdraw.SettableRenderer

Paints the edge in the color specified by the EdgeColorFunction or the hard-set color, and at the thickness set with an EdgeThicknessFunction.

paintVertex(Graphics, Vertex, int, int) - Method in class edu.uci.ics.jung.visualization.AbstractRenderer

paintVertex(Graphics, Vertex, int, int) - Method in interface edu.uci.ics.jung.visualization.Renderer

paintVertex(Graphics, Vertex, int, int) - Method in class edu.uci.ics.jung.visualization.graphdraw.SettableRenderer

Paints the vertex, using the settings above (VertexColors, etc).

pairs - Static variable in class edu.uci.ics.jung.utils.TestGraphs

A series of pairs that may be useful for generating graphs.

pauseObject - Variable in class edu.uci.ics.jung.visualization.VisualizationViewer

peek() - Method in class edu.uci.ics.jung.utils.MapBinaryHeap

permuteEdges(Graph) - Method in class edu.uci.ics.jung.random.permuters.BernoulliEdgePermuter

Permutes the edges with default probability 1, meaning that if an edge is sample it will either be removed or added depending on whether it exists already

permuteEdges(Graph, double) - Method in class edu.uci.ics.jung.random.permuters.BernoulliEdgePermuter

Permutes the edges using a user-specified probability that an edge is removed or added.

permuteEdges(Graph) - Method in interface edu.uci.ics.jung.random.permuters.EdgePermuter

Instructs the algoritm to go ahead and permute the edges for the given graph

pop() - Method in class edu.uci.ics.jung.utils.MapBinaryHeap

prerelax() - Method in class edu.uci.ics.jung.visualization.VisualizationViewer

Runs the visualization forward a few hundred iterations (for half a second)

printParameters(PrintStream) - Static method in class edu.uci.ics.jung.utils.NumericalPrecision

printRankings(boolean, boolean) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker

Print the rankings to standard out in descending order of rank score

printVertices(Collection, StringLabeller) - Static method in class edu.uci.ics.jung.utils.GraphUtils

For every vertex in s, prints sl.get(s).

propagateMinimumLevel(Vertex) - Static method in class edu.uci.ics.jung.visualization.contrib.DAGLayout

A recursive method for allocating the level for each vertex.