- testSplitComponents(List<SplitComponent<V, E>>, SplitPair<V, E>) - Method in class graph.properties.splitting.Splitting
-
All components should have two vertices in common: split pair vertices
and no edges
- TopologicalOrdering - Class in graph.ordering
-
A topological ordering T(G) is an assignment of integer values T(v) to each
vertex v in V such that for every directed edge (u,v) in E T(u) < T(v)
- TopologicalOrdering() - Constructor for class graph.ordering.TopologicalOrdering
-
- toString() - Method in class graph.algorithms.connectivity.PlanarAugmentationLabel
-
- toString() - Method in class graph.algorithms.interlacement.InterlacementGraphEdge
-
- toString() - Method in class graph.algorithms.interlacement.InterlacementGraphVertex
-
- toString() - Method in class graph.algorithms.lrpartition.LRPartition
-
- toString() - Method in class graph.algorithms.planarity.BoyerMyrvoldPlanarity.Block
-
- toString() - Method in class graph.algorithms.planarity.dual.DualGraphEdge
-
- toString() - Method in class graph.algorithms.planarity.dual.DualGraphVertex
-
- toString() - Method in class graph.algorithms.planarity.dual.STDualGraph
-
- toString() - Method in class graph.algorithms.planarity.Embedding
-
- toString() - Method in class graph.drawing.Drawing
-
- toString() - Method in class graph.elements.Graph
-
- toString() - Method in class graph.elements.Path
-
- toString() - Method in exception graph.exception.CannotBeAppliedException
-
- toString() - Method in exception graph.exception.DSLException
-
- toString() - Method in class graph.layout.router.orthogonal.OrthogonalConnector
-
- toString() - Method in class graph.math.Line
-
- toString() - Method in class graph.math.Triangle
-
- toString() - Method in class graph.properties.components.Component
-
- toString() - Method in class graph.properties.components.HopcroftTarjanSplitComponent
-
- toString() - Method in class graph.properties.components.SeparationPair
-
- toString() - Method in class graph.properties.components.SplitPair
-
- toString() - Method in class graph.properties.components.Triple
-
- toString() - Method in class graph.symmetry.CyclicPermutation
-
- toString() - Method in class graph.symmetry.nauty.OrderedPartition
-
- toString() - Method in class graph.symmetry.Permutation
-
- toString() - Method in class graph.symmetry.PermutationCycle
-
- toString() - Method in class graph.symmetry.PermutationGroup
-
- toString() - Method in class graph.tree.bc.BCTreeEdge
-
- toString() - Method in class graph.tree.bc.BCTreeNode
-
- toString() - Method in class graph.tree.binary.BinaryTree
-
- toString() - Method in class graph.tree.binary.BinaryTreeNode
-
- toString() - Method in class graph.tree.pq.PQTree
-
- toString() - Method in class graph.tree.pq.PQTreeEdge
-
- toString() - Method in class graph.tree.pq.PQTreeNode
-
- toString() - Method in class graph.tree.spqr.Skeleton
-
- toString() - Method in class graph.tree.spqr.SPQRTreeNode
-
- toString() - Method in class graph.tree.spqr.TreeEdgeWithContent
-
- toString() - Method in class graph.trees.dfs.DFSTree
-
- toString() - Method in class graph.util.Pair
-
- TraversalUtil - Class in graph.traversal
-
Contains methods for finding path between vertices which meet certain
special conditions.
- TraversalUtil() - Constructor for class graph.traversal.TraversalUtil
-
- treeEdgesBetween(V, V) - Method in class graph.trees.dfs.DFSTree
-
Finds all tree edges between the given two vertices
- TreeEdgeWithContent<V extends Vertex,E extends Edge<V>> - Class in graph.tree.spqr
-
Class which implements the Edge interface and adds the content attribute
Used for constructing SPQR-trees
- TreeEdgeWithContent() - Constructor for class graph.tree.spqr.TreeEdgeWithContent
-
Construct an empty edge
- TreeEdgeWithContent(V, V) - Constructor for class graph.tree.spqr.TreeEdgeWithContent
-
Constructs an edge between the given two vertices
- TreeEdgeWithContent(V, V, Graph<V, E>) - Constructor for class graph.tree.spqr.TreeEdgeWithContent
-
Constructs an edge between the given two vertices
- treeLeaves(V) - Method in class graph.properties.GraphProperties
-
Lists all tree leaves (presumes that the graph is a tree)
- treePathBetween(V, V) - Method in class graph.trees.dfs.DFSTree
-
Finds a tree path (presented as a list of vertices belonging to it)
between the two given vertices
- Triangle - Class in graph.math
-
A triangle suited for the use inside convex drawing algorithm
- Triangle(Point2D, Point2D, Point2D) - Constructor for class graph.math.Triangle
-
Constructs a triangle with the given 3 points as its apices
- triangleAngle(double, double, double) - Static method in class graph.math.Calc
-
Finds an angle of the triangle in its apex c, given lengths of its sides
- triangleCentroid(Point2D, Point2D, Point2D) - Static method in class graph.math.Calc
-
Finds centroid of the given triangle, given positions of its apices
- triangleCentroid(Triangle) - Static method in class graph.math.Calc
-
Finds centroid of the triangle, given the whole triangle object
- TriangulatedEdge<V extends Vertex> - Class in graph.ordering.circular
-
Triangulated edge as defined in algorithm CIRCULAR
- TriangulatedEdge(V, V) - Constructor for class graph.ordering.circular.TriangulatedEdge
-
- Triple - Class in graph.properties.components
-
A triple as defined by Hopcroft and Tarjan and used in their triconnected splitting algorithms
- Triple(int, int, int) - Constructor for class graph.properties.components.Triple
-
Constructs a triple with the provided h,a and b values.
- TutteEmbedding<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.drawing
-
Implementations of Tutte's (or barycentric) embedding of a simple 3-vertex-connected planar graph.
- TutteEmbedding(Graph<V, E>) - Constructor for class graph.algorithms.drawing.TutteEmbedding
-
- TutteLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout.straight.line
-
A layouter which creates a drawing of the graph using Tutte's embedding
- TutteLayouter() - Constructor for class graph.layout.straight.line.TutteLayouter
-