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

P

Pair<K,V> - Class in graph.util

A util class representing a key-value pair

Pair(K, V) - Constructor for class graph.util.Pair

parallelLineThroughPoint(Line, Point2D) - Static method in class graph.math.Calc

Finds a line parallel to the given line containing the given point

partContainingVertex(V) - Method in class graph.symmetry.nauty.OrderedPartition

Finds a part which contains the given vertex

partialChildrenCount() - Method in class graph.tree.pq.PQTreeNode

Only used for P-nodes

Path<V extends Vertex,E extends Edge<V>> - Class in graph.elements

Represents a path (list of edges)

Path() - Constructor for class graph.elements.Path

Creates an empty path

Path(List<E>, List<EdgeDirection>) - Constructor for class graph.elements.Path

Creates a path given edges and the direction in which they are traversed

Path(List<E>) - Constructor for class graph.elements.Path

Creates a path given the edges it contains.

pathVertices() - Method in class graph.elements.Path

Finds all vertices belonging to the path

pathVertivesWithoutDuplicates() - Method in class graph.elements.Path

List all vertices on the path, only including one vertex once, even if it is contained multiple times

PatonSimpleCycles<V extends Vertex,E extends Edge<V>> - Class in graph.algorithm.cycles

Find a cycle basis of an undirected graph using the Paton's algorithm.

PatonSimpleCycles(Graph<V, E>) - Constructor for class graph.algorithm.cycles.PatonSimpleCycles

Create a cycle basis finder for the specified graph.

Permutation - Class in graph.symmetry

Class represents a permutation in the mapping notation

Permutation() - Constructor for class graph.symmetry.Permutation

Creates an empty permutation

Permutation(Map<Integer, Integer>) - Constructor for class graph.symmetry.Permutation

Creates a permutation with an initial value

PermutationAnalyzator<V extends Vertex,E extends Edge<V>> - Class in graph.symmetry

A class containing methods for analyzing permutations of a graph

PermutationAnalyzator(Graph<V, E>) - Constructor for class graph.symmetry.PermutationAnalyzator

Given a graph, finds its permutations and intializes the permutations list

PermutationCycle<V extends Vertex> - Class in graph.symmetry

Represents one permutation cycle

PermutationCycle(List<V>) - Constructor for class graph.symmetry.PermutationCycle

Constructs a cycle given a list of vertices it consists of

PermutationCycle(List<V>, List<Integer>) - Constructor for class graph.symmetry.PermutationCycle

Constructs a permutation cycle given a list of vertices and indexes of those which should be a part of the cycle

PermutationGroup - Class in graph.symmetry

Represents a permutation group and contains methods for its analysis

PermutationGroup(Permutation, Permutation) - Constructor for class graph.symmetry.PermutationGroup

Constructs a permutation group given a reflection and/or a rotation

perpendicularLineIntersectingOnPoint(Line, Point2D) - Static method in class graph.math.Calc

Finds a line which is perpendicular to the the given line and contains it point p

pickAlgorithm(List<V>, List<E>) - Method in class graph.layout.automatic.LayoutPicker

pickAlgorithm(Graph<V, E>) - Method in class graph.layout.automatic.LayoutPicker

Picks the appropriate algorithm based on the properties of the graph

PlanarAugmentation<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.connectivity

Given a connected, but not biconnected planar graph, the algorithm adds a minimum number of edges to turn it into a biconnected graph while not ruining the planarity This implementation is based on Fialko and Mutzel's 5/3 approximation

PlanarAugmentation() - Constructor for class graph.algorithms.connectivity.PlanarAugmentation

PlanarAugmentationLabel<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.connectivity

A bundle of pendants together with its parent is called a label.

PlanarAugmentationLabel(BCTreeNode) - Constructor for class graph.algorithms.connectivity.PlanarAugmentationLabel

planarBiconnected(Graph<V, E>) - Method in class graph.algorithms.connectivity.PlanarAugmentation

Finds edges which need to be added in order to transform the graph into a planar biconnected one.

PlanarConvexEmbedding<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.drawing

Part of Chiba's convex drawing algorithm Determines if a graph has convex drawing and finds the extendable facial cycle

PlanarConvexEmbedding(Graph<V, E>) - Constructor for class graph.algorithms.drawing.PlanarConvexEmbedding

PlanarEmbedding - Class in graph.algorithms.planarity

Class containing methods for calculating planar embedding

PlanarEmbedding() - Constructor for class graph.algorithms.planarity.PlanarEmbedding

PlanarFaces<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.planarity

Finds planar faces of a graph.

PlanarFaces(Graph<V, E>) - Constructor for class graph.algorithms.planarity.PlanarFaces

PlanarFaces(Graph<V, E>, STNumbering<V, E>) - Constructor for class graph.algorithms.planarity.PlanarFaces

PlanarityTestingAlgorithm<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.planarity

A class which should be extended by all planarity testing implementations

PlanarityTestingAlgorithm() - Constructor for class graph.algorithms.planarity.PlanarityTestingAlgorithm

PositionAction - Class in graph.layout.util

Class needed to get the positions of graph elements after a prefuse's layout algorithm is performed.

PositionAction(long) - Constructor for class graph.layout.util.PositionAction

positionEdges(List<E>) - Method in class graph.drawing.Drawing

Once positions of vertices are calculated, this method sets positions of edges (their nodes).

PQNodeLabel - Enum in graph.tree.pq

Possible labels of PQ-nodes

PQNodeMark - Enum in graph.tree.pq

A list of PQ-node marks

PQNodeOrderValid - Enum in graph.tree.pq

Validity of PQ-nodes (valid, invalid or needs to be reversed)

PQNodeType - Enum in graph.tree.pq

Types of PQ-nodes

PQTree<V extends Vertex,E extends Edge<V>> - Class in graph.tree.pq

Class represents a PQ-tree, which is used in some algorithms for planarity testing P nodes are cut vertices Q nodes are nonseparable components Leaves are virtual vertices (vertices on the other side of edges where one vertex is on subgraph Gk and the other one is in V-Vk)

PQTree(Graph<V, E>, List<E>, Map<V, Integer>) - Constructor for class graph.tree.pq.PQTree

Construct the PQ tree, given the a graph, a list of virtual edges and st-numbering

PQTreeEdge - Class in graph.tree.pq

Edge of the PQ-tree

PQTreeEdge(PQTreeNode, PQTreeNode) - Constructor for class graph.tree.pq.PQTreeEdge

Constructs the PQ-tree edge given origin and destination nodes

PQTreeNode - Class in graph.tree.pq

Node of the PQ-tree

PQTreeNode(PQNodeType) - Constructor for class graph.tree.pq.PQTreeNode

Construct a PQ-tree node of the given type.

PQTreeNode(PQNodeType, Object) - Constructor for class graph.tree.pq.PQTreeNode

Constructs a PQ-tree node of the given type with the specified content

PQTreePlanarity<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.planarity

Implementation of the PQ tree planarity testing based on Booth and Lueker's algorithm

PQTreePlanarity(V, V) - Constructor for class graph.algorithms.planarity.PQTreePlanarity

PQTreePlanarity() - Constructor for class graph.algorithms.planarity.PQTreePlanarity

PQTreeReduction<V extends Vertex,E extends Edge<V>> - Class in graph.tree.pq

Implementation of the PQ-tree reduction procedure, as described by Booth and Lueker.

PQTreeReduction() - Constructor for class graph.tree.pq.PQTreeReduction

PrefuseBalloonLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout.tree

A layouter which creates a drawing of a graph using prefuse's balloon tree drawing algorithm

PrefuseBalloonLayouter() - Constructor for class graph.layout.tree.PrefuseBalloonLayouter

PrefuseForceDirectedLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout.force.directed

Layouter which uses prefuse framework's force-directed layout

PrefuseForceDirectedLayouter() - Constructor for class graph.layout.force.directed.PrefuseForceDirectedLayouter

PrefuseNodeLinkTreeLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout.tree

A layouter which creates a drawing of a graph using prefuse's node link tree drawing algorithm

PrefuseNodeLinkTreeLayouter() - Constructor for class graph.layout.tree.PrefuseNodeLinkTreeLayouter

PrefuseRadialTreeLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout.tree

A layouter which creates a drawing of a graph using prefuse's radial tree drawing algorithm

PrefuseRadialTreeLayouter() - Constructor for class graph.layout.tree.PrefuseRadialTreeLayouter

printAdjacencyMatrix() - Method in class graph.elements.Graph

Prints adjacency matrix

printMatrix() - Method in class graph.math.Matrix

Prints the matrix

printMatrix(Matrix) - Static method in class graph.math.MatrixUtil

Prints the given matrix

printPartition() - Method in class graph.algorithms.lrpartition.LRPartition

printPartitions() - Method in class graph.algorithms.lrpartition.LRPartitionSet

Prints partitions

PropertyEnums - Interface in graph.layout

List of all properties for each implemented layout algorithm Each enum contains values used for generic implementation of the user interface

PropertyEnums.BalloonProperties - Enum in graph.layout

All configurable properties of the balloon tree layout algorithm

PropertyEnums.BoxProperties - Enum in graph.layout

All configurable properties of the box layouter

PropertyEnums.CircleProperties - Enum in graph.layout

All configurable properties of the circular layout algorithm

PropertyEnums.CompactTreeProperties - Enum in graph.layout

All configurable properties of the compact tree layout algorithm

PropertyEnums.FastOrganicProperties - Enum in graph.layout

All configurable properties of the fast organic layout algorithm

PropertyEnums.FruchtermanReingoldProperties - Enum in graph.layout

All configurable properties of the Fruchterman-Reingold layout algorithm

PropertyEnums.HierarchicalProperties - Enum in graph.layout

All configurable properties of the hierarchical layout algorithm

PropertyEnums.KamadaKawaiProperties - Enum in graph.layout

All configurable properties of the Kamada-Kawai layout algorithm

PropertyEnums.NodeLinkTreeProperties - Enum in graph.layout

All configurable properties of the node-link tree layout algorithm

PropertyEnums.OrganicProperties - Enum in graph.layout

All configurable properties of the organic layout algorithm

PropertyEnums.RadialTree2Properties - Enum in graph.layout

All configurable properties of the second radial tree layout algorithm

PropertyEnums.RadialTreeProperties - Enum in graph.layout

All configurable properties of the radial tree layout algorithm

PropertyEnums.SpringProperties - Enum in graph.layout

All configurable properties of the spring layout algorithm

PropertyEnums.SymmetricProperties - Enum in graph.layout

All configurable properties of the symetric layout algorithm

PropertyEnums.TreeProperties - Enum in graph.layout

All configurable properties of the standard tree layout algorithm

PropertyEnums.TutteProperties - Enum in graph.layout

All configurable properties of Tutte's algorithm

ProtoSPQRTree<V extends Vertex,E extends Edge<V>> - Class in graph.tree.spqr

Used in the construction of SPQR trees Not a very efficient implementation, needs to be rewritten Can be used for smaller graphs

ProtoSPQRTree(E, Graph<V, E>) - Constructor for class graph.tree.spqr.ProtoSPQRTree

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