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

S

SearchTree<V extends Vertex> - Class in graph.symmetry.nauty

Class represents a search tree defined and used in graph labeling algorithm

SearchTree(OrderedPartition<V>) - Constructor for class graph.symmetry.nauty.SearchTree

Creates a search tree given its root partition

SearchTreeNode<V extends Vertex> - Class in graph.symmetry.nauty

Class represents a search tree node

SearchTreeNode(OrderedPartition<V>, V, SearchTreeNode<V>) - Constructor for class graph.symmetry.nauty.SearchTreeNode

Creates a node of the search tree given its partition, a vertex that splits it and its parent

separate(int, int) - Method in class graph.drawing.Drawing

Moves vertices of the drawing in order to increase the distances between them

SeparationPair<V extends Vertex> - Class in graph.properties.components

A separation pair, used in Hopcroft-Tarjan splitting

SeparationPair(V, V, int) - Constructor for class graph.properties.components.SeparationPair

Creates a separation pair containing two provided vertices of the specified type

SeparationPairSplitting<V extends Vertex,E extends Edge<V>> - Class in graph.properties.splitting

An implementation of Hopcroft-Tarjan's algorithm for finding separation pairs

SeparationPairSplitting() - Constructor for class graph.properties.splitting.SeparationPairSplitting

set(int, int, double) - Method in class graph.math.Matrix

Sets value of a particular cell of the matrix

setA(Point2D) - Method in class graph.math.Triangle

setA(V) - Method in class graph.properties.components.SeparationPair

setA(int) - Method in class graph.properties.components.Triple

setAlgorithm(LayoutAlgorithms) - Method in class graph.layout.Layouter

setAllFaces(List<List<E>>) - Method in class graph.algorithms.planarity.PlanarFaces

setB(Point2D) - Method in class graph.math.Triangle

setB(V) - Method in class graph.properties.components.SeparationPair

setB(int) - Method in class graph.properties.components.Triple

setBeforeParent(boolean) - Method in class graph.math.Triangle

setBoundaryVertices(List<V>) - Method in class graph.algorithms.planarity.BoyerMyrvoldPlanarity.Block

setbVertices(List<BCTreeNode>) - Method in class graph.tree.bc.BCTree

setC(Point2D) - Method in class graph.math.Triangle

setCentroid(Point2D) - Method in class graph.math.Triangle

setChildren(List<Graph<V, E>>) - Method in class graph.algorithms.connectivity.PlanarAugmentationLabel

setChildren(List<PQTreeNode>) - Method in class graph.tree.pq.PQTreeNode

setChildren(List<SPQRTreeNode<V, E>>) - Method in class graph.tree.spqr.SPQRTreeNode

setContent(Object) - Method in class graph.algorithms.interlacement.InterlacementGraphVertex

setContent(Object) - Method in class graph.algorithms.planarity.dual.DualGraphVertex

setContent(Object) - Method in class graph.elements.impl.GraphVertex

setContent(Object) - Method in interface graph.elements.Vertex

setContent(Object) - Method in class graph.tree.bc.BCTreeNode

setContent(Object) - Method in class graph.tree.pq.PQTreeNode

setContent(Object) - Method in class graph.tree.spqr.SPQRTreeNode

setContent(Graph<V, E>) - Method in class graph.tree.spqr.TreeEdgeWithContent

setCutVertex(V) - Method in class graph.properties.components.Block

setcVertices(List<BCTreeNode>) - Method in class graph.tree.bc.BCTree

setCycle(List<V>) - Method in class graph.symmetry.PermutationCycle

setCycles(List<PermutationCycle<V>>) - Method in class graph.symmetry.CyclicPermutation

setDestination(InterlacementGraphVertex<V, E>) - Method in class graph.algorithms.interlacement.InterlacementGraphEdge

setDestination(DualGraphVertex<V, E>) - Method in class graph.algorithms.planarity.dual.DualGraphEdge

setDestination(V) - Method in interface graph.elements.Edge

setDestination(GraphVertex) - Method in class graph.elements.impl.GraphEdge

setDestination(V) - Method in class graph.ordering.circular.TriangulatedEdge

setDestination(BCTreeNode) - Method in class graph.tree.bc.BCTreeEdge

setDestination(PQTreeNode) - Method in class graph.tree.pq.PQTreeEdge

setDestination(V) - Method in class graph.tree.spqr.TreeEdgeWithContent

setDifferent(List<E>) - Method in class graph.algorithms.lrpartition.LRPartitionEdge

setDirected(boolean) - Method in class graph.elements.Graph

setDirected(boolean) - Method in class graph.traversal.DijkstraAlgorithm

setDirections(List<EdgeDirection>) - Method in class graph.elements.Path

setDuration(long) - Method in class graph.algorithm.ExecuteResult

setEdge(E) - Method in class graph.algorithms.lrpartition.LRPartitionEdge

setEdgeMappings(Map<E, List<Point2D>>) - Method in class graph.drawing.Drawing

setEdgePosition(E, List<Point2D>) - Method in class graph.drawing.Drawing

Add an edge with positions of its nodes to the mapping

setEdges(List<E>) - Method in class graph.algorithms.planarity.BoyerMyrvoldPlanarity.Block

setEdges(List<E>) - Method in class graph.elements.Graph

setEdges(List<E>) - Method in class graph.layout.Layouter

setEdges(List<E>) - Method in class graph.properties.components.Component

setEdges(List<E>) - Method in class graph.properties.components.HopcroftTarjanSplitComponent

Sets edges and initializes the virtual edges list.

setEdges(List<E>) - Method in class graph.traversal.DijkstraAlgorithm

setEmbedding(Map<V, List<E>>) - Method in class graph.algorithms.planarity.Embedding

setEntryDirection(EntryDirection) - Method in class graph.layout.router.orthogonal.OrthogonalConnector

seteXMap(Map<E, Integer>) - Method in class graph.algorithms.drawing.VisibilityRepresentation

setExternalFace(V, Direction) - Method in class graph.algorithms.planarity.BoyerMyrvoldPlanarity.Block

Sets a new external face based on the old one

seteYMaxMap(Map<E, Integer>) - Method in class graph.algorithms.drawing.VisibilityRepresentation

seteYMinMap(Map<E, Integer>) - Method in class graph.algorithms.drawing.VisibilityRepresentation

setgPrim(Graph<V, E>) - Method in class graph.tree.spqr.ProtoSPQRTree

setGraph(Graph<V, E>) - Method in class graph.properties.components.Block

setGraph(Graph<V, E>) - Method in class graph.properties.components.SplitComponent

setGraph(Graph<V, E>) - Method in class graph.tree.spqr.ProtoSPQRTree

setH(int) - Method in class graph.properties.components.Triple

setHeight(int) - Method in class graph.tree.binary.BinaryTreeNode

setK(Double) - Method in class graph.math.Line

setKey(K) - Method in class graph.util.Pair

setLabel(PQNodeLabel) - Method in class graph.tree.pq.PQTreeNode

setLayoutProperties(GraphLayoutProperties) - Method in class graph.layout.Layouter

setLeaves(List<PQTreeNode>) - Method in class graph.tree.pq.PQTree

setLeft(List<E>) - Method in class graph.algorithms.lrpartition.LRPartition

setLeft(BinaryTreeNode<V>) - Method in class graph.tree.binary.BinaryTreeNode

setMark(PQNodeMark) - Method in class graph.tree.pq.PQTreeNode

setN(Double) - Method in class graph.math.Line

setNodes(List<BinaryTreeNode<V>>) - Method in class graph.tree.binary.BinaryTree

setNodeType(NodeType) - Method in class graph.tree.spqr.SPQRTreeNode

setNumber(int) - Method in class graph.layout.router.orthogonal.OrthogonalConnector

setOneGraph(boolean) - Method in class graph.layout.AbstractLayouter

setOrigin(InterlacementGraphVertex<V, E>) - Method in class graph.algorithms.interlacement.InterlacementGraphEdge

setOrigin(DualGraphVertex<V, E>) - Method in class graph.algorithms.planarity.dual.DualGraphEdge

setOrigin(V) - Method in interface graph.elements.Edge

setOrigin(GraphVertex) - Method in class graph.elements.impl.GraphEdge

setOrigin(V) - Method in class graph.ordering.circular.TriangulatedEdge

setOrigin(BCTreeNode) - Method in class graph.tree.bc.BCTreeEdge

setOrigin(PQTreeNode) - Method in class graph.tree.pq.PQTreeEdge

setOrigin(V) - Method in class graph.tree.spqr.TreeEdgeWithContent

setParent(BCTreeNode) - Method in class graph.algorithms.connectivity.PlanarAugmentationLabel

setParent(BCTreeNode) - Method in class graph.tree.bc.BCTreeNode

setParent(BinaryTreeNode<V>) - Method in class graph.tree.binary.BinaryTreeNode

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

setParentTriangle(Triangle) - Method in class graph.math.Triangle

setPartition(List<List<V>>) - Method in class graph.symmetry.nauty.OrderedPartition

setPath(List<E>) - Method in class graph.elements.Path

setPendants(List<Graph<V, E>>) - Method in class graph.tree.bc.BCTree

setPermutation(Map<Integer, Integer>) - Method in class graph.symmetry.Permutation

setPermutations(List<Permutation>) - Method in class graph.symmetry.PermutationGroup

setPertinendChildCount(int) - Method in class graph.tree.pq.PQTreeNode

setPertinentLeafCount(int) - Method in class graph.tree.pq.PQTreeNode

setPositionsEdges(boolean) - Method in class graph.layout.AbstractLayouter

setProperty(PropertyEnums, Object) - Method in class graph.layout.GraphLayoutProperties

Sets a value of a property with the given key

setReferenceEdge(E) - Method in class graph.tree.spqr.ProtoSPQRTree

setReursiveLinkDistance(int) - Method in class graph.drawing.Drawing

setRight(List<E>) - Method in class graph.algorithms.lrpartition.LRPartition

setRight(BinaryTreeNode<V>) - Method in class graph.tree.binary.BinaryTreeNode

setRoot(V) - Method in class graph.algorithms.planarity.BoyerMyrvoldPlanarity.Block

setRoot(SearchTreeNode<V>) - Method in class graph.symmetry.nauty.SearchTree

setRoot(BCTreeNode) - Method in class graph.tree.bc.BCTree

setRoot(BinaryTreeNode<V>) - Method in class graph.tree.binary.BinaryTree

setRoot(PQTreeNode) - Method in class graph.tree.pq.PQTree

setRoot(SPQRTreeNode<V, TreeEdgeWithContent<V, E>>) - Method in class graph.tree.spqr.AbstractTree

setRoot(SPQRTreeNode<V, TreeEdgeWithContent<V, E>>) - Method in class graph.tree.spqr.ProtoSPQRTree

setRoot(V) - Method in class graph.trees.dfs.DFSTree

setSame(List<E>) - Method in class graph.algorithms.lrpartition.LRPartitionEdge

setSize(Dimension) - Method in class graph.algorithms.interlacement.InterlacementGraphVertex

setSize(Dimension) - Method in class graph.algorithms.planarity.dual.DualGraphVertex

setSize(Dimension) - Method in class graph.elements.impl.GraphVertex

setSize(Dimension) - Method in interface graph.elements.Vertex

setSize(Dimension) - Method in class graph.tree.bc.BCTreeNode

setSize(Dimension) - Method in class graph.tree.pq.PQTreeNode

setSize(Dimension) - Method in class graph.tree.spqr.SPQRTreeNode

setSkeleton(Skeleton<V, E>) - Method in class graph.tree.spqr.SPQRTreeNode

setSpearaionPair(SplitPair<V, E>) - Method in class graph.properties.components.HopcroftTarjanSplitComponent

setSplitPair(SplitPair<V, E>) - Method in class graph.properties.components.SplitComponent

setStNumbering(Map<V, Integer>) - Method in class graph.algorithms.planarity.Embedding

setStNumbers(Map<V, Integer>) - Method in class graph.algorithms.planarity.PQTreePlanarity

setType(SplitTriconnectedComponentType) - Method in class graph.properties.components.HopcroftTarjanSplitComponent

setType(int) - Method in class graph.properties.components.SeparationPair

setType(int) - Method in class graph.properties.components.SplitPair

setType(BCNodeType) - Method in class graph.tree.bc.BCTreeNode

setType(PQNodeType) - Method in class graph.tree.pq.PQTreeNode

setU(V) - Method in class graph.properties.components.SplitPair

setV(V) - Method in class graph.properties.components.SplitPair

setValid(boolean) - Method in class graph.algorithms.lrpartition.LRPartitionEdge

setValue(Object) - Method in class graph.algorithm.ExecuteResult

setValue(V) - Method in class graph.util.Pair

setVertex(V) - Method in class graph.layout.router.orthogonal.OrthogonalConnector

setVertex(V) - Method in class graph.tree.binary.BinaryTreeNode

setVertexMappings(Map<V, Point2D>) - Method in class graph.drawing.Drawing

setVertexPosition(V, Point2D) - Method in class graph.drawing.Drawing

Add a vertex with its position to the mapping

setVertices(List<V>) - Method in class graph.algorithms.planarity.BoyerMyrvoldPlanarity.Block

setVertices(List<V>) - Method in class graph.elements.Graph

setVertices(List<V>) - Method in class graph.layout.Layouter

setVertices() - Method in class graph.properties.components.HopcroftTarjanSplitComponent

Sets the components vertices based on the edges that it contains

setVirtualEdge(Object) - Method in class graph.tree.pq.PQTreeNode

setVirtualEdges(List<E>) - Method in class graph.properties.components.HopcroftTarjanSplitComponent

setVirtualEdges(List<E>) - Method in class graph.tree.spqr.Skeleton

setvXMaxMap(Map<V, Integer>) - Method in class graph.algorithms.drawing.VisibilityRepresentation

setvXMinMap(Map<V, Integer>) - Method in class graph.algorithms.drawing.VisibilityRepresentation

setvYMap(Map<V, Integer>) - Method in class graph.algorithms.drawing.VisibilityRepresentation

setWeight(int) - Method in class graph.algorithms.interlacement.InterlacementGraphEdge

setWeight(int) - Method in class graph.algorithms.planarity.dual.DualGraphEdge

setWeight(int) - Method in interface graph.elements.Edge

setWeight(int) - Method in class graph.elements.impl.GraphEdge

setWeight(int) - Method in class graph.ordering.circular.TriangulatedEdge

setWeight(int) - Method in class graph.tree.bc.BCTreeEdge

setWeight(int) - Method in class graph.tree.pq.PQTreeEdge

setWeight(int) - Method in class graph.tree.spqr.TreeEdgeWithContent

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

Finds all simple cycles of a given graph.

SimpleCyclesFinder() - Constructor for class graph.algorithm.cycles.SimpleCyclesFinder

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

Finds all cycles of a graph

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

size() - Method in class graph.algorithms.connectivity.PlanarAugmentationLabel

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

Size of the path - number of edges belonging to it

size() - Method in class graph.symmetry.PermutationCycle

size() - Method in class graph.symmetry.PermutationGroup

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

Each node is associated with a special graph which is called a skeleton of the node It is a simplified version of the original graph where some subgraphs were replaces

Skeleton() - Constructor for class graph.tree.spqr.Skeleton

Constructs the skeleton and initializes an empty list of virtual edges

Skeleton(List<V>, List<E>) - Constructor for class graph.tree.spqr.Skeleton

Constructs the skeleton and sets lists of vertices and edges.

Skeleton(List<V>, List<E>, List<E>) - Constructor for class graph.tree.spqr.Skeleton

Constructs the skeleton and sets lists of vertices, edges and virtual edges.

SplitComponent<V extends Vertex,E extends Edge<V>> - Class in graph.properties.components

Class represents a split component of a graph

SplitComponent(SplitPair<V, E>, Graph<V, E>) - Constructor for class graph.properties.components.SplitComponent

Constructs a split component of the provided split pair and graph

splitGraph(List<SplitComponent<V, E>>, E) - Method in class graph.properties.splitting.Splitting

A split graph of a split pair with respect of some edge is the union of all split components which don't contain that edge

splitGraph(SplitPair<V, E>, E, Graph<V, E>) - Method in class graph.properties.splitting.Splitting

Finds a split graph with respect to the given split pair and edge

SplitPair<V extends Vertex,E extends Edge<V>> - Class in graph.properties.components

Class represent a split pair of a graph.

SplitPair(V, V) - Constructor for class graph.properties.components.SplitPair

Construct a split pair consisting of the two given vertices

SplitPair(V, V, int) - Constructor for class graph.properties.components.SplitPair

Construct a split pair consisting of the two given vertices and of the specified type

splitPairIsDominantedBy(Graph<V, E>, SplitPair<V, E>, SplitPair<V, E>, E) - Method in class graph.properties.splitting.Splitting

Checks if one split pair is dominated by another given an edge A split pair {u,v} is dominated by another split pair {x,y} if

Splitting<V extends Vertex,E extends Edge<V>> - Class in graph.properties.splitting

A class containing methods regarding graph splitting, such as finding cut vertices Some methods need to be rewritten due to being slow

Splitting() - Constructor for class graph.properties.splitting.Splitting

SplitTriconnectedComponentType - Enum in graph.properties.components

Enumeration listing all possible types of a triconnected component

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

SPQR-trees implicitly represent all embeddings of a graph The triconnected components of a biconnected graph are a system of smaller graphs that describe all of the 2-vertex cuts in the graph.

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

Constructs a SPQR tree of the given graph

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

Node of the SPQR tree

SPQRTreeNode() - Constructor for class graph.tree.spqr.SPQRTreeNode

Construct an empty tree node

SPQRTreeNode(NodeType) - Constructor for class graph.tree.spqr.SPQRTreeNode

Constructs a SPQR tree node of the given type

SPQRTreeNode(NodeType, Skeleton<V, E>) - Constructor for class graph.tree.spqr.SPQRTreeNode

Construct a SPQR tree node of the given type and sets its skeleton

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

Construct a SPQR tree node of the given type and sets its skeleton

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

Layouter which uses JUNG framework's spring layout

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

stabilizers(Integer) - Method in class graph.symmetry.PermutationGroup

Finds stabilizers of the group with respect to some vertex

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

Constructs a st-dual graph Given a planar st-graph G, the dual planar st-graph G = (V, E) is a digraph with the following properties: - V* is the set of faces in G with the addition that the external face (s, .

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

Construct the st-dual graph given a graph, external face and s and t vertices

STNumbering<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.numbering

Given any edge {s,t} in a biconnected graph G with n vertices, the vertices can be numbered from 1 to n so that vertex s receives the number 1 and vertex t the number n This is called the st-numbering This implementation is based on an algoritm by Even and Tarjan from their paper titled "Computing an st-numbering"

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

subgraph(List<V>) - Method in class graph.elements.Graph

Creates a subgraph of the graph containing the given vertices

subsetStabilizers(List<Integer>) - Method in class graph.symmetry.PermutationGroup

Finds stabilizers of the groups with respect to a subset of vertices

SymmetricCircleLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout.symmetric

Layouter which creates a drawing of a graph using Carr and Kocay's symmetric circular algorithm

SymmetricCircleLayouter() - Constructor for class graph.layout.symmetric.SymmetricCircleLayouter

SymmetricLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout.symmetric

Abstract layouter, meant to be extended by all symmetric layouters.

SymmetricLayouter() - Constructor for class graph.layout.symmetric.SymmetricLayouter

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

Finds a point symmetric to the given point with the axis being the provided line

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